FIT-IDMAcad. year: 2020/2021
Sets, relations and mappings. Equivalences and partitions. Posets. Structures with one and two operations. Lattices and Boolean algebras. Propositional and predicate calculus. Elementary notions of graph theory. Connectedness. Subgraphs and morphisms of graphs. Planarity. Trees and their properties. Basic graph algorithms. Network flows.
Learning outcomes of the course unit
Recommended optional programme components
Kovár, M., Diskrétní matematika, FEKT VUT, Brno, 2013. (in Czech).
Grimaldi R. P., Discrete and Combinatorial Mathematics, Pearson Addison Valley, Boston 2004.
Grossman P., Discrete mathematics for computing, Palgrave Macmillan, New York 2002.
Kolibiar, M. a kol., Algebra a príbuzné disciplíny, Alfa, Bratislava, 1992. (in Slovak).
Kolman B., Busby R. C., Ross S. C., Discrete Mathematical Structures, Pearson Education, Hong-Kong 2001.
Matoušek J., Nešetřil J., Kapitoly z diskrétní matematiky, Karolinum, Praha 2007. (in Czech).
O'Donnell, J., Hall C., Page R., Discrete Mathematics Using a Computer, Springer-Verlag, London 2006.
Sochor, A., Klasická matematická logika, Karolinum, Praha 2001. (in Czech).
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
- Evaluation of the five written tests (max 40 points).
The minimal total score of 15 points gained out of the five written tests.
Language of instruction
Specification of controlled education, way of implementation and compensation for absences
- The knowledge of students is tested at exercises; at five written tests for 8 points each, and at the final exam for 60 points.
- If a student can substantiate serious reasons for an absence from an exercise, (s)he can either attend the exercise with a different group (please inform the teacher about that).
- Passing boundary for ECTS assessment: 50 points.
Type of course unit
Teacher / Lecturer
- The formal language of mathematics. A set intuitively. Basic set operations. Power set. Cardinality. Sets of numbers. The principle of inclusion and exclusion.
- Binary relations and mappings. The composition of binary relations and mappings.
- Reflective, symmetric, and transitive closure. Equivalences and partitions.
- Partially ordered sets and lattices. Hasse diagrams. Mappings.
- Binary operations and their properties.
- General algebras and algebras with one operation. Groups as algebras with one operation. Congruences and morphisms.
- General algebras and algebras with two operations. Lattices as algebras with two operations. Boolean algebras.
- Propositional logic. Syntax and Semantics. Satisfiability and validity. Logical equivalence and logical consequence. Ekvivalent formulae. Normal forms.
- Predicate logic. The language of first-order predicate logic. Syntax, terms, and formulae, free and bound variables. Interpretation.
- Predicate logic. Semantics, truth definition. Logical validity, logical consequence. Theories. Equivalent formulae. Normal forms.
- A formal system of logic. Hilbert-style axiomatic system for propositional and predicate logic. Provability, decidability, completeness, incompleteness.
- Basic concepts of graph theory. Graph Isomorphism. Trees and their properties. Trails, tours, and Eulerian graphs.
- Finding the shortest path. Dijkstra's algorithm. Minimum spanning tree problem. Kruskal's and Jarnik's algorithms. Planar graphs.
Teacher / Lecturer
prof. Dr. Ing. Jan Černocký
RNDr. Petr Fuchs, Ph.D.
Ing. Vojtěch Havlena, Ph.D.
prof. Ing. Adam Herout, Ph.D.
doc. RNDr. Dana Hliněná, Ph.D.
doc. Mgr. Lukáš Holík, Ph.D.
Ing. Jiří Hynek, Ph.D.
Ing. Bohuslav Křena, Ph.D.
Ing. Zbyněk Křivka, Ph.D.
Ing. Ondřej Lengál, Ph.D.
Ing. Vojtěch Mrázek, Ph.D.
Mgr. Ing. Pavel Očenášek, Ph.D.
Mgr. Juraj Síč
Ing. Aleš Smrčka, Ph.D.
Ing. Josef Strnadel, Ph.D.
doc. RNDr. Zdeněk Svoboda, CSc.
Ing. Ján Švec
Mgr. Gabriela Vážanová, Ph.D.
prof. Dr. Ing. Pavel Zemčík, dr. h. c.