Seminar of Discrete Mathematics and Logics
SDL Acad. year 2022/2023 Winter semester 1 credits
Set, relation, map, function, equivalence, ordering, lattice. Algebraical structures with one and two operations. Homomorphisms and congruences. Lattices and Boolean algebras. Propositional and predicate logic: syntax, semantics, normal forms of formulae, proofs, theories, correctness and completeness.
Language of instruction
The goal is to refresh and possibly complete knowledge of notions from discrete mathematics and logic that are essential for computer science, and also practice usage of the mathematical apparatus and language.
Why is the course taught
Computer science is built on discrete mathematics and logic. Awareness of their basic notions and concepts is important in all areas of computer science, especially on a more advanced level, for orientation in literature, in discussions, to precisely and understandably express complex ideas and concepts, and to specify systems and their properties.
Prerequisite knowledge and skills
The course is designed as a recapitulation of basic concepts, hence a prior exposure to discrete mathematics and logic on a university level is desirable but not necessary.
- Grossman P., Discrete mathematics for computing, Palgrave Macmillan, New York 2002.
- Kolibiar, M. a kol., Algebra a príbuzné disciplíny, Alfa, Bratislava, 1992.
- Matoušek J., Nešetřil J., Invitation to Discrete Mathematics, Oxford University Press, Oxford 2008.
- Sochor, A., Klasická matematická logika, Karolinum, Praha 2001.
Final test, required is 55 points from 100.
- A written final test, with the maximum gain of 100 points. There will two terms of the test, hence a student has at most two attempts to pass the course (if he/she attends both terms).
- If a student can substantiate serious reasons for an absence from both tests, (s)he will be examined individually.
- Voluntary homeworks may be posted during the semester. They are scored according to their difficulty (solving the homeworks is not necessary to pass the course).
Obtaining at least 50 points from the final test (and possibly also voluntary homeworks).
|Fri||exam||2022-12-09||E104 E105 E112||12:00||13:40||Závěrečný test|
|Fri||exercise||1., 2., 3., 5., 7., 8., 11. of lectures||E104 E105 E112||12:00||13:50||9999||1MIT 2MIT||NBIO - NSPE xx||Češka, Holík, Lengál, Rogalewicz, Vojnar|
Course inclusion in study plans