FI:IB000 Math. Foundations of CS - Course Information
IB000 Mathematical Foundations of Computer ScienceFaculty of Informatics
- Extent and Intensity
- 2/2/0. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).
- prof. RNDr. Petr Hliněný, Ph.D. (lecturer)
doc. Mgr. Jan Obdržálek, PhD. (seminar tutor)
RNDr. David Klaška (seminar tutor)
doc. RNDr. Pavel Matula, Ph.D. (seminar tutor)
RNDr. Martin Maška, Ph.D. (seminar tutor)
doc. RNDr. David Svoboda, Ph.D. (seminar tutor)
RNDr. Nikola Beneš, Ph.D. (seminar tutor)
Mgr. Vojtěch Sysel (seminar tutor)
RNDr. Bc. Dominik Velan (seminar tutor)
Mgr. Matúš Bezek (seminar tutor)
Mgr. Radka Cieslarová (seminar tutor)
RNDr. Jaroslav Čechák (seminar tutor)
Mgr. Jakub Lédl (seminar tutor)
Mgr. Viktória Vozárová (seminar tutor)
Mgr. Matej Evin (seminar tutor)
Mgr. Matúš Hlaváčik (seminar tutor)
Mgr. Filip Pokrývka (seminar tutor)
Mgr. Jana Baranová (assistant)
Bc. Ondřej Darmovzal (assistant)
Bc. Tomáš Novotný (assistant)
RNDr. Adam Rambousek, Ph.D. (assistant)
Mgr. Michal Románek (assistant)
Mgr. Miloslav Staněk (assistant)
- Guaranteed by
- prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science - Faculty of Informatics
Supplier department: Department of Computer Science - Faculty of Informatics
- Mon 8:00–9:50 D2, Mon 8:00–9:50 D1
- Timetable of Seminar Groups:
IB000/A2: Tue 12:00–13:50 C416, D. Klaška
IB000/01: Wed 10:00–11:50 A319, J. Obdržálek
IB000/02: Mon 10:00–11:50 A218, J. Obdržálek
IB000/03: Thu 8:00–9:50 A218, P. Matula
IB000/04: Wed 14:00–15:50 C525, M. Maška
IB000/05: Mon 16:00–17:50 B410, M. Maška
IB000/06: Wed 10:00–11:50 C525, D. Svoboda
IB000/07: Wed 8:00–9:50 B410, D. Svoboda
IB000/08: Tue 12:00–13:50 A217, N. Beneš
IB000/09: Tue 14:00–15:50 C525, M. Evin
IB000/10: Tue 8:00–9:50 C525, R. Cieslarová
IB000/11: Fri 8:00–9:50 B410, D. Velan
IB000/12: Tue 16:00–17:50 B410, D. Velan
IB000/13: Wed 12:00–13:50 C511, V. Sysel
IB000/14: Mon 10:00–11:50 C511, J. Čechák
IB000/15: Tue 10:00–11:50 C511, J. Čechák
IB000/16: Wed 14:00–15:50 C416, V. Vozárová
IB000/17: Tue 8:00–9:50 C416, V. Vozárová
IB000/18: Tue 18:00–19:50 B411, M. Bezek
IB000/19: Tue 16:00–17:50 C416, M. Bezek
IB000/20: Mon 16:00–17:50 B411, F. Pokrývka
IB000/21: Tue 10:00–11:50 C525, P. Hliněný
IB000/22: Tue 14:00–15:50 B411, R. Cieslarová
IB000/23: Tue 12:00–13:50 C525, M. Hlaváčik
IB000/24: Thu 8:00–9:50 C525, J. Lédl
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- there are 19 fields of study the course is directly associated with, display
- Course objectives
- This course is focused on understanding basic mathematical concepts necessary for study of computer science. This is essential for building up a set of basic concepts and formalisms needed for other theoretical courses in computer science. At the end of this course the successful students should: know the basic mathematical notions; understand the logical structure of mathematical statements and mathematical proofs, specially mathematical induction; know discrete mathematical structures such as finite sets, relations, functions, and graph; be able to precisely formulate their claims, algorithms, and relevant proofs; and apply acquired knowledge in other CS courses as well as in practice later on.
- Learning outcomes
- After finishing the course the student will be able to: understand the logical structure of mathematical statements and mathematical proofs, deal with and explain basic structures of discrete mathematics, precisely formulate their claims, algorithms, and relevant proofs.
- The course focuses on understanding basic mathematical tools:
- Basic formalisms - statements, proofs, and propositional logic.
- Sets, relations, and functions.
- Proof techniques, mathematical induction.
- Recursion, structural induction.
- Binary relations, closure, transitivity.
- Equivalence and partial orders.
- Composition of relations and functions.
- Basics of graphs, isomorphism, connectivity, trees.
- Graph distance, spanning trees. Directed graphs.
- Proof techniques for algorithms.
- Infinite sets and the halting problem.
- Teaching methods
- This subject has regular weekly lectures and compulsory tutorials. Moreover, the students are expected to practice at home using online questionnaires, via IS MU. All the study materials and study agenda are presented through the online IS syllabus.
- Assessment methods
- Students' evaluation in this course consists of (the sum of) three parts which have rougly equal weights: through term evaluation (minimal score is required), "computer" written exam, and optional classical written exam.
The semester evaluation is computed as the sum of a certain number of the best out of all term tests, plus possible bonus points for solving voluntary assignments. Details can be found in the IS course syllabus. Then the "computer" exam follows, and its sum with the semester evaluation determines student's success in the course. Optional written exam at the end gives students the opportunity to get higher grades.
- Language of instruction
- Further comments (probably available only in Czech)
- Study Materials
Information on completion of the course: Pozor, ukončení zápočtem lze volit pouze ve výjimečných případech, kdy to umožňuje váš studijní program.
The course is taught annually.
- Listed among pre-requisites of other courses
- Teacher's information