Compulsory elective courses

Title	Mathematical Foundations of Cryptography
Code	ÚINF/MZK/06	Teacher	Geffert Viliam, Lacko Vladimír
ECTS credits	6	Hrs/week	3/2
Assessment	Examination	Semester	1, 3
T/L method	Lecture, Practical
Content	Classical cryptography. Steganography. Conventional symmetric cryptography. Feistel networks. Encryption modes: ECB, CBC, CFB, OFB. Security definitions. Models of an adversary. Cryptoanalysis. Asymmetric cryptosystems. One-way functions with trapdoors. RSA cryptosystem. El-Gamal cryptosystem. Generating large prime numbers. Elliptic curves cryptography. Keyed Hash functions. Collision resistant functions. Birthday paradox. SHA-1. Message authentication codes. Password security. Digital signatures. Blind signatures. Key management. X509. Certificates. Certification authorities. Electronic payments. Electronic cash.
Exclusive courses	ÚINF/UKR1/03

Title	Neural Networks
Code	ÚINF/NEU1/03	Teacher	Andrejková Gabriela
ECTS credits	5	Hrs/week	2/1
Assessment	Examination	Semester	1
T/L method	Lecture, Practical
Objective	To establish student understanding and knowledge for using basic paradigms of neural networks.
Content	Feed-forward and recurrent neural networks; back propagation algorithm to adaptation of neural networks; capability of neural networks to be universal approximators. Hopfield neural networks and solving optimisation problems. Kohonen neural networks. Neural networks in connections to computational models. Theoretical problems of neural networks.
Alternate courses	ÚINF/NEU1/00 orÚINF/NEU1/99
Recommended reading	J. Hertz, A. Krogh, R.G. Palmer: Introduction to the theory of neural computation, Addison Wesley, 1991

Title	Nontraditional Optimisation Techniques I
Code	ÚFV/NOT1a/03	Teacher	Horváth Denis, Uličný Jozef, Brutovský Branislav
ECTS credits	5	Hrs/week	2/2
Assessment	Examination	Semester	1, 3
T/L method	Lecture, Practical
Objective	To allow students to learn major optimisation methods.
Content	The classification of optimisation methods. Optimisation function. Multifunction-optimisation. The penalty function. The Barier function. The stochastic and deterministic methods. Gradient methods. The physical picture of gradient optimisation. Blind search and hill climbing methods. Multi-agent evolutionary strategy and meta-optimisation. Genetic algorithms. Quantum mechanical applications of genetic algorithms. Genetic algorithms in variable environments. The training of neural nets as optimisation. Principal component analysis. The prediction of time series.  Monte Carlo techniques and simulated annealing. Optimisation and self-organisation attractor. The self-organised Kohonen nets; neural gas model. Cellular automata models. Agent-based systems. Strategies and demographic games on the lattice. Swarm optimisation.
Recommended reading	J.C.Principe, N.R.Euliano, Neural and Adaptive Systems, John Wiley & Sons. INC., New York, 2000 K.Binder, D.W.Heermann, Monte Carlo Simulation in Statistical Physics, Springer-Verlag, Berlin, 2002

Title	Theory of Information
Code	ÚMV/TIN1/03	Teacher	Bukovský Lev
ECTS credits	4	Hrs/week	2/-
Assessment	Examination	Semester	1, 3
T/L method	Lecture
Objective	To introduce students to mathematical attempts at solving selected problems of computer science.
Content	Measurement of information. Entropy and its properties. Shanon’s theorems. Coding and basic types of codes. Using of algebraic structures in construction of codes. Kolmogorov complexity. Basic properties and relation to the notion of entropy. Complexity and randomness.
Recommended reading	J. H. van Lint, Introduction to Coding Theory, Springer 1992 M. Li and P. Vitanyi, Kolmogorov Complexity and its Applications, Handbook of Theoretical Computer Science, Elsevier, 1990, p. 188-252

Title	Foundations of Knowledge Systems
Code	ÚINF/ZNA1/06	Teacher	Vojtáš Peter
ECTS credits	4	Hrs/week	2/-
Assessment	Examination	Semester	1, 3
T/L method	Lecture
Content	Relations of formal models: DBMS, SQL, and logic programming. Summary of different formal models of computational processes, connections among them and translations. Gentzenov systems, semantics and verification of programs. Formal specifications, temporal logics: formulas, models, tableaux.
Recommended reading	M. Ben-Ari. Mathematical logic for Computer Science 2ed. Springer Verlag London 2001 J. Ullman. Principles of database and knowledge based systems. Comp. Sci. Press 1988 J. W. Lloyd. Foundations of logic programming. Springer Berlin 1987

Title	Encoding and Transfer of Information
Code	ÚINF/KPI1/01	Teacher	Geffert Viliam, Jirásek Jozef
ECTS credits	4	Hrs/week	2/1
Assessment	Examination	Semester	1, 3
T/L method	Lecture, Practical
Objective	To provide students knowledge of basic principles of information theory, coding and data compression.
Content	Introduction to information theory: entropy, Markov models. Huffman coding, adaptive Huffman coding, applications. Arithmetic coding, dictionary techniques, applications. Lossless image compression. Scalar and vector quantisations. Differential encoding, delta modulation, subband coding, wavelets. Transform coding, DFT, DCT, application to JPEG. Analysis/synthesis schemes; fractal compression. Video compression.
Alternate courses	ÚINF/KPI1/00
Recommended reading	D. Hankersson, G. Harris, P. Johnson: Introduction to Information Theory and Data Compression, CRC Pr.,1998 K. Sayood: Introduction to Data Compression, Morgan Kaufmann, 1996

Title	Algorithmically Unsolvable Problems
Code	ÚMV/ANP/03	Teacher	Bukovský Lev
ECTS credits	4	Hrs/week	2/-
Assessment	Examination	Semester	2
T/L method	Lecture
Objective	To introduce students to the most important results about the non-existence of an algorithm for solving a given problem.
Content	Axiomatic theories of natural numbers. Definability of recursive functions. Tarski’s theorem on undefinability of truth in formalised arithmethic. Godel incompleteness theorem. Algorithmic unsolvability of particular mathematical problems. Non-existence of an algorithm for finding a solution to Diophantine equations. Reduction of problems and degrees of unsolvability.
Recommended reading	J. Barwise ed., Handbook of Mathematical Logic, North Holland 1977S. C. Kleene, Introduction to the Metamathematics, Van Nostrand 1952, ruský preklad Moskva 1957 E. Mendelson, Introduction to Mathematical Logic, Van Nostrand 1963. M. Davis, Hilbert's Tenth Problem is Unsolvable, Amer. Math. Monthly, 1973, 233--269

Title	Classical and Quantum Computations
Code	ÚINF/KKV1/06	Teacher	Semanišin Gabriel
ECTS credits	6	Hrs/week	3/1
Assessment	Examination	Semester	1, 3
T/L method	Lecture, Practical
Objective	To provide students information on quantum computers and quantum computations. To allow students to compare classical and quantum models and methods.
Content	The basics of classical theory of computation: Turing machines, Boolean circuits, parallel algorithms, probabilistic computation, NP-complete problems, and the idea of complexity of an algorithm.  Introduction of general quantum formalism (pure states, density matrices, and superoperators), universal gate sets and approximation theorems. Grover's algorithm, Shor's factoring algorithm, and the Abelian hidden subgroup problem. Parallel quantum computation, a quantum analogue of NP-completeness, and quantum error-correcting codes.
Recommended reading	A. Yu. Kitaev, Classical and Quantum Computation, American Mathematical Society, Graduate Studies in Mathematics 47 (2002), ISBN 0-8218-3229-8 Gruska, J: Quantum Computing. McGraw-Hill London 1999

Title	Combinatorial Algorithms
Code	ÚMV/KOA1/04	Teacher	Jendroľ Stanislav, Lacko Vladimír
ECTS credits	5	Hrs/week	3/-
Assessment	Examination	Semester	2
T/L method	Lecture
Content	Introduction to graphs. Introduction to algorithms and complexity. Sorting algorithms. Search algorithms. Greedy algorithms. NP-completeness. Trees and rooted trees. Generating all spanning trees of a graph. Minimum spanning tree problem. Distance in graphs. Shortest path problem and its analogues. Location centres. Networks. Eulerian gaphs and Chinese Postman's Problem. Hamiltonian graphs. Travelling Salesman Problem. Matchings. Transportation and assignment problems.
Exclusive courses	ÚMV/KOO/04
Recommended reading	N. Christophides, Graph Theory: An Algorithmic Approach,   Academic Press, New York 1975 G. Chartrand, O. R. Oellermann, Applied and Algorithmic Graph Theory, McGraw-Hill, Inc., New York 1993

Title	Cryptographic Protocols
Code	ÚINF/KRP1/06	Teacher	Jirásek Jozef
ECTS credits	4	Hrs/week	2/1
Assessment	Examination	Semester	1
T/L method	Lecture, Practical
Objective	To teach students about the design and verification of cryptographic protocols
Content	Authentication and key establishment using shared and public key cryptography, key agreement protocols, conference key agreement, zero-knowledge protocols.
Recommended reading	1. Colin Boyd, Anish Mathuria: Protocols for Authentication and Key Establishment, Springer, 2003 2. Douglas R. Stinson: Cryptography: Theory and Practice, Third Edition, Chapman & Hall/CRC, 2006 3. Bruce Schneier: Applied Cryptography, Second Edition, John Wiley & Sons Inc., 1996 4. Peter Ryan, Steve Schneider: Modelling and Analysis of Security Protocols, Addison-Wesley, 2001

Title	Logical Aspects of Databases
Code	ÚINF/LAD1/06	Teacher	Krajči Stanislav
ECTS credits	4	Hrs/week	2/-
Assessment	Examination	Semester	2
T/L method	Lecture
Objective	To have students understand and be able to formalise relationships between databases, first order logic and logic programming.
Content	Relationships between databases, logic and logic programming.
Recommended reading	Serge Abiteboul, Richard Hull, Victor Vianu: Foundations of Databases. Addison-Wesley 1995, ISBN 0-201-53771-0

Title	Nontraditional Optimisation Techniques II
Code	ÚFV/NOT1b/03	Teacher	Horváth Denis, Uličný Jozef, Brutovský Branislav
ECTS credits	5	Hrs/week	2/2
Assessment	Examination	Semester	2
T/L method	Lecture, Practical
Objective	To teach students applications of optimisation techniques on thestudy and interpretation of complex systems using examples from biology. To introduce students to new paradigms in the area of systems biology.
Content	Complex systems; emergent behavior. Evolutionary theory and memetics. Application of optimisation techniques on complex systems. Application of methods (genetic algorithms, simulated annealing, taboo search) on selected problems of biomolecular simulations. Molecular dynamics; protein folding. Population dynamics, metabolic networks and complexity in bioinformatics.
Recommended reading	The actual scientific papers.

Title	Network Programming Seminar
Code	ÚINF/SPS1/00	Teacher	Andrejková Gabriela
ECTS credits	3	Hrs/week	-/3
Assessment	Assessment	Semester	1
T/L method	Practical
Objective	To teach students current technologies of programming in a network distributed environment.
Content	Basics of programming client-server applications, iterative and concurrent servers, Remote Procedure Calls. Server-side programming, CGI, PHP, basics of Perl and Python. Script languages, ASP, JSP, Component Object Model, Corba, database connection's interfaces. Document Object Model, XML, XSL, dynamic extensions of HTML. Advanced level of programming is expected.
Recommended reading	Internet sources and specifications.

Title	Biomolecular Simulations
Code	ÚFV/BSIM1/03	Teacher	Uličný Jozef
ECTS credits	6	Hrs/week	2/2
Assessment	Examination	Semester	2
T/L method	Lecture, Practical
Objective	To introduce students to actual problems of biomolecular simulations.
Content	Structural characteristics of biological polymers. Foldamers. Central dogma of molecular biology as flow of biological information. 3D-structure and function of foldamers. Recent view on enzyme mechanisms. Experimental methods of structure determination and their limitations. Empirical force fields and methods of classical molecular dynamics. Molecular dynamics and Monte Carlo methods: algorithms and parallelisation. Ab initio molecular dynamics and hybrid approaches. Computational challenges in biomolecular simulations: simulations of chemical reactions, free energy evaluation, protein folding. Computational complexity, nontraditional approaches and heuristic approaches.

Title	Seminar on Principles of Database Development
Code	ÚINF/SPD1a/07	Teacher
ECTS credits	2	Hrs/week	-/2
Assessment	Assessment	Semester	1, 3
T/L method	Practical
Objective	To have students understand common database system concepts and to be able to use their knowledge of database principles to solve commom optimalisation problems with very large data.
Content	Data storing, file organisation, tree indexing methods, B-trees, R-trees, hash methods, prefect and partial hashing, hash indices, external sort, relational operators processing, top-k join, query optimisation, transactions, parallel and distributed databases, security, recovery system, performance measurement, data reduction, objekct databases, XML databases.
Prerequisite courses	ÚINF/DBS1b/03
Recommended reading	R. Ramakrishnan,J. Gehrke: Database Management Systems, McGraw Hill Higher Education, 2003 A. Silberschatz, H. F. Korth, S. Sudarshan: Database system concepts, McGraw Hill Higher Education, 2006

Title	Computational Statistics and Simulation Methods
Code	ÚMV/VP1/04	Teacher	Žežula Ivan
ECTS credits	5	Hrs/week	1/2
Assessment	Examination	Semester	3
T/L method	Lecture, Practical
Objective	To familiarise students with modern software and computational and simulation methods in statistics.
Content	Systems of statistical software. Computation of distribution functions. Matrix computations. Random numbers generation. General and specific methods for generating random numbers with a given distribution. Monte Carlo methods. Resampling. Exploratory data analysis.
Alternate courses	ÚMV/VP1/99
Recommended reading	Abramowitz, Stegun: Handbook of mathematical functions, Dover Publications, 1972 Deák: Random number generators and simulation, Akadémiai kiadó, 1990 Fishman: Monte Carlo. Concepts, Algorithms, and Applications., Springer, 1996

Title	Architecture of Information Systems
Code	ÚINF/AIS1/01	Teacher	Semanišin Gabriel
ECTS credits	4	Hrs/week	2/1
Assessment	Examination	Semester	2
T/L method	Lecture, Practical
Objective	To provide an overview of an older and of the newest information system development techniques.
Content	Information system, subsystem; information system development life cycle. Visual modelling; overview of modelling techniques. Structured methodologies. Verification and validation. Testing. Identification of critical systems. Quality control. Planning. MDA life cycle. MDA models. Transformations. OMG standards for languages.
Recommended reading	http://www.omg.org Sommerville, I.: Software Engineering, Addison-Wesley 2005 Kleppe, A., Bast, W.,Warmer, J. B.: MDA Explained, the Model Driven Architecture, Addison-Wesley 2003 Berkun, S.: The Art Of Project Management, O Reilly 2005

Title	Computational Learning
Code	ÚINF/VYU1/03	Teacher	Andrejková Gabriela
ECTS credits	5	Hrs/week	2/1
Assessment	Examination	Semester	2
T/L method	Lecture, Practical
Objective	To provide students with basic knowledge about computational learning algorithms.
Content	Concepts, hypotheses, learning algorithms. Boolean formulae and representation, learning algorithms for disjunctions. Probabilistic learning, consistent algorithms and learnability, efficient learning, probably approximately correct (PAC) learning, Occam algorithms, Vapnik-Cervonenkis (VC) dimension and learning algorithms.
Alternate courses	ÚINF/VYU1/00
Recommended reading	M. Anthony, N. Biggs: Computational Learning Theory, Cambridge University Press, 1991 M. J. Kearns, U. V. Vazirani: An Introduction to Computational Learning Theory, MIT Press London, 1994

Title	Computer Graphics Seminar
Code	ÚINF/SPG1/05	Teacher	Jirásek Jozef
ECTS credits	3	Hrs/week	-/2
Assessment	Assessment	Semester	2
T/L method	Practical
Content	Seminar is connected to the lecture course Introduction to Computer Graphics (UGR). Students will present actual theoretical and implementation problems involving quick algorithms for computer graphics, geometric modelling and realistic drawing of scenes. Knowledge from UGR and good programming experience are expected.

Title	Parallel and Distributed Systems
Code	ÚINF/PDS1/03	Teacher	Geffert Viliam, Jirásek Jozef
ECTS credits	4	Hrs/week	2/1
Assessment	Examination	Semester	2, 4
T/L method	Lecture, Practical
Objective	To introduce students to the fundamentals of parallel and distributed programming
Content	Current parallel and distributed architectures; basic issues in parallel and distributed applications development; data structures and programming methodologies
Alternate courses	ÚINF/PDS1/00
Recommended reading	Kenneth A. Berman and Jerome L. Paul: Algorithms: Sequential, Parallel, and Distributed, Thomson, 2005, ISBN 0-534-42057-5 Gregory R. Andrews: Foundations of Multithreaded, Parallel, and Distributed Programming, Addison-Wesley, 2000, ISBN 0-201-35752-6 Joseph JáJá: An Introduction to Parallel Algorithms, Addison-Wesley, 1992, ISBN 0-201-54856-9 Gerard Tel: Introduction to Distributed Algorithms, Cambridge University Press, 1994, ISBN 0-521-47069-2

Title	Architecture of Computers
Code	ÚINF/ARP1/05	Teacher	Jirásek Jozef
ECTS credits	4	Hrs/week	2/1
Assessment	Examination	Semester	2, 4
T/L method	Lecture, Practical
Objective	To provide students with knowledge of the basic principles of computer architecture.
Content	Milestones in computer organisation; fundamental limitations. The representation of numbers and the implementation of floating point arithmetic. Combinatorial and sequential circuits, memory organisation, RAMs and ROMs. Digital logic level architecture, data path timing, machine cycle. The microarchitecture level: microinstructions and microinstrucion control. The instruction set architecture level: data types, addressing modes, instruction types. Instruction execution, pipelining, cache memory. I/O controllers, ports, interrupts, direct memory access. Device drivers, operating system kernel, device-independent software.
Recommended reading	A. S. Tanenbaum: Structured Computer Organisation, 4.ed., Prentice-Hall, 1999 W. Stallings: Computer Organisation and Architecture, 4.ed., Prentice-Hall, 1996 J. Blieberger, G. H. Schildt, U. Schmid, S. Stoeckler: Informatik, Springer-Verlag, 1990

Title	Data Mining Seminar
Code	ÚINF/SDM1a/07	Teacher
ECTS credits	2	Hrs/week	-/2
Assessment	Assessment	Semester	2, 4
T/L method	Practical
Objective	To teach students the basic process of knowledge discovery in databases, its methods and principles.  To familiarise students with data mining methods and with multi-relational learning and its use in complex-data structures.
Content	Pre-processing and data preparation (data cleaning, noise handling, data transformation), data mining, use and verification of result.  Types of data mining methods: descriptive (regression, clustering, association rules) and predictive (classification and regression trees).  Multi-relational learning (inductive logic programming) and its use in complex-data structures
Recommended reading	Sašo Džeroski, Nada Lavrač: Relational Data Mining. Springer-Verlag, 2001, ISBN 3-540-42289-7 David Hand, Heikki Mannila, Phadraic Smyth: Principles of Data mining. The MIT Press, 2001, ISBN 0-262-08290-X. Jiawei Han, Micheline Kamber: Data Mining:Concepts and Techniques. Morgan Kaufmann Publishers, 2001, ISBN 1-55860-489-8 Dorian Pyle: Data Preparation for Data Mining. Morgan Kaufmann Publishers, 1999, ISBN 1-55860-529-0

Title	Security of Computer Networks Seminar
Code	ÚINF/DSB1a/01	Teacher	Jirásek Jozef
ECTS credits	2	Hrs/week	-/2
Assessment	Assessment	Semester	2
T/L method	Practical
Objective	To present new knowledge in the area of cryptology and the security of computer networks in seminar form. To examine the current state of research in the area using conference proceedings and specialised journals.
Content	Seminar is oriented to the individual work of students who are pursuing diploma theses in the area of computer network security.
Exclusive courses	ÚINF/DSL1a/01,ÚINF/DSN1a/01,ÚINF/DST1a/01
Recommended reading	Special and research literature connected to Diploma theses according to recommendations of supervisor. ISO 690: 1987 Documentation - Bibliographic references. Content, form and structure. ISO 2145: 1978 Documentation - Numbering of divisions and subdivisions in written documents.

Title	Logic of Information Systems Seminar
Code	ÚINF/DSL1a/01	Teacher	Krajči Stanislav
ECTS credits	2	Hrs/week	-/2
Assessment	Assessment	Semester	2
T/L method	Practical
Objective	To present new knowledge in the area of logic of information and knowledge systems in seminar form. To examine the current state of research in the area using conference proceedings and specialised journals.
Content	Seminar is oriented to the individual work of students who are pursuing diploma theses in the area of logic of information systems.
Exclusive courses	ÚINF/DSB1a/01,ÚINF/DSN1a/01,ÚINF/DST1a/01
Recommended reading	Special and research literature connected to Diploma theses according to recommendations of supervisor. ISO 690: 1987 Documentation - Bibliographic references. Content, form and structure. ISO 2145: 1978 Documentation - Numbering of divisions and subdivisions in written documents.

Title	Neural Networks and Stringology Seminar
Code	ÚINF/DSN1a/04	Teacher	Andrejková Gabriela
ECTS credits	2	Hrs/week	-/2
Assessment	Assessment	Semester	2
T/L method	Practical
Objective	To present new knowledge in the area of neural networks and stringology in seminar form. To examine the current state of research in the area using conference proceedings and specialised journals.
Content	Seminar is oriented to the individual work of students who are pursuing diploma theses in the area of neural networks and stringology.
Alternate courses	ÚINF/DSN1a/01
Recommended reading	Special and research literature connected to Diploma theses according to recommendations of supervisor. ISO 690: 1987 Documentation - Bibliographic references. Content, form and structure. ISO 2145: 1978 Documentation - Numbering of divisions and subdivisions in written documents.

Title	Theoretical Informatics Seminar
Code	ÚINF/DST1a/01	Teacher	Geffert Viliam
ECTS credits	2	Hrs/week	-/2
Assessment	Assessment	Semester	2
T/L method	Practical
Objective	To present new knowledge in the area of theoretical informatics in seminar form. To examine the current state of research in the area using conference proceedings and specialised journals.
Content	Seminar is oriented to the individual work of students who are pursuing diploma theses in the area of theoretical foundations of informatics.
Exclusive courses	ÚINF/DSB1a/01,ÚINF/DSL1a/01,ÚINF/DSN1a/01
Recommended reading	Special and research literature connected to Diploma theses according to recommendations of supervisor. ISO 690: 1987 Documentation - Bibliographic references. Content, form and structure. ISO 2145: 1978 Documentation - Numbering of divisions and subdivisions in written documents.

Title	Applied Informatics Seminar
Code	ÚINF/DSA1a/06	Teacher
ECTS credits	2	Hrs/week	-/2
Assessment	Assessment	Semester	2
T/L method	Practical
Objective	To present new knowledge in the area of applied informatics in seminar form. To examine the current state of research in the area using conference proceedings and specialised journals.
Content	Seminar is oriented to the individual work of students who are pursuing diploma theses in the area of information system development, the application of combinatorial algorithms, etc.
Recommended reading	Special and research literature connected to Diploma theses according to recommendations of supervisor. ISO 690: 1987 Documentation - Bibliographic references. Content, form and structure. ISO 2145: 1978 Documentation - Numbering of divisions and subdivisions in written documents.

Title	Security of Computer Networks Seminar
Code	ÚINF/DSB1b/01	Teacher	Jirásek Jozef
ECTS credits	2	Hrs/week	-/2
Assessment	Assessment	Semester	3
T/L method	Practical
Objective	To present new knowledge in the area of cryptology and security of computer networks in seminar form. To examine the current state of research in the area using conference proceedings and specialised journals.
Content	Seminar is oriented to the individual work of students who are pursuing diploma theses in the area of the security of computer networks.
Automatic prerequisite courses	ÚINF/DSB1a/01
Recommended reading	Special and research literature connected to Diploma theses according to recommendations of supervisor. ISO 690: 1987 Documentation - Bibliographic references. Content, form and structure. ISO 2145: 1978 Documentation - Numbering of divisions and subdivisions in written documents.

Title	Logic of Information Systems Seminar
Code	ÚINF/DSL1b/01	Teacher	Krajči Stanislav
ECTS credits	2	Hrs/week	-/2
Assessment	Assessment	Semester	3
T/L method	Practical
Objective	To present new knowledge in the area of logic of information and knowledge systems in seminar form. To examine the current state of research in the area using conference proceedings and specialised journals.
Content	Seminar is oriented to the individual work of students who are pursuing diploma theses in the area of logic of information systems.
Prerequisite courses	ÚINF/DSL1a/01
Automatic prerequisite courses	ÚINF/DSL1a/01
Recommended reading	Special and research literature connected to Diplomaa theses according to recommendations of supervisor. ISO 690: 1987 Documentation - Bibliographic references. Content, form and structure. ISO 2145: 1978 Documentation - Numbering of divisions and subdivisions in written documents.