Obtaining directly applicable knowledge of discrete mathematical structures relevant to computer science. Ability to learn the development of high abstraction algorithms.
By mastering the content of the course a student will be able to acquire the following course-specific abilities: the competence of abstract description and solving different types of problems, active participation in the creation of a system of high generality and complexity, ability to monitor and apply new mathematical procedures, skills development and eagerness to solve practical problems.
• Collections, relationships, and functions
• Algebraic structures
• Theory of groups, rings and fields
• Boolean functions
• Binary Decision Diagrams (BDD)
• Computability, decisiveness and complexity
• Turing machine
• The fundamentals of graph theory
A. Petrović, A. Jovanović, B. Veličković (2007), Teorija skupova, Matematički fakultet, Beograd
R. Garnier, J. Taylor (2002), Discrete mathematics for new technology, Institute of Physics Publishing
Z. Ognjenović (2011), Diskretna matematika (skripta), Matematički fakultet, Beograd