FI:IB000 Math. Foundations of CS - Course Information
IB000 Mathematical Foundations of Computer ScienceFaculty of Informatics
- Extent and Intensity
- 2/2/1. 4 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)
RNDr. Nikola Beneš, Ph.D. (seminar tutor)
RNDr. Jaroslav Čechák (seminar tutor)
Mgr. Adam Kabela, Ph.D. (seminar tutor)
Mgr. Jakub Kadlecaj (seminar tutor)
RNDr. David Klaška (seminar tutor)
Bc. Michal Korbela (seminar tutor)
Mgr. Jakub Lédl (seminar tutor)
Mgr. Lukáš Másilko (seminar tutor)
RNDr. Martin Maška, Ph.D. (seminar tutor)
doc. RNDr. Pavel Matula, Ph.D. (seminar tutor)
RNDr. Petr Novotný, Ph.D. (seminar tutor)
doc. Mgr. Jan Obdržálek, PhD. (seminar tutor)
Matěj Pavlík (seminar tutor)
Bc. Kristýna Pekárková (seminar tutor)
Mgr. Vojtěch Suchánek (seminar tutor)
doc. RNDr. David Svoboda, Ph.D. (seminar tutor)
Bc. Anh Minh Tran (seminar tutor)
RNDr. Bc. Dominik Velan (seminar tutor)
Bc. Ondřej Darmovzal (assistant)
Mgr. Filip Pokrývka (assistant)
Roman Solař (assistant)
- Guaranteed by
- prof. RNDr. Petr Hliněný, Ph.D.
Department of Computer Science - Faculty of Informatics
Supplier department: Department of Computer Science - Faculty of Informatics
- Tue 10:00–11:50 D1, Tue 10:00–11:50 D3, Tue 10:00–11:50 D2
- Timetable of Seminar Groups:
IB000/A2: Wed 12:00–13:50 B411, D. Klaška
IB000/T01: Wed 2. 10. to Sun 22. 12. Wed 10:00–11:50 KOM 117, L. Másilko, Nepřihlašuje se. Určeno pro studenty se zdravotním postižením.
IB000/01: Tue 12:00–13:50 C416, K. Pekárková
IB000/02: Tue 14:00–15:50 C416, J. Čechák
IB000/03: Tue 16:00–17:50 B411, J. Čechák
IB000/04: Tue 16:00–17:50 C525, M. Pavlík
IB000/05: Tue 18:00–19:50 B410, A. Kabela
IB000/06: Wed 8:00–9:50 B411, M. Maška
IB000/07: Wed 8:00–9:50 B410, D. Svoboda
IB000/08: Wed 10:00–11:50 C525, P. Novotný
IB000/09: Wed 10:00–11:50 B411, M. Maška
IB000/10: Wed 12:00–13:50 A319, N. Beneš
IB000/11: Wed 14:00–15:50 C416, V. Suchánek
IB000/12: Wed 16:00–17:50 B411, P. Novotný
IB000/13: Wed 18:00–19:50 A218, M. Korbela
IB000/14: Thu 8:00–9:50 A320, J. Obdržálek
IB000/15: Thu 8:00–9:50 C525, P. Hliněný
IB000/16: Thu 8:00–9:50 C416, D. Velan
IB000/17: Thu 10:00–11:50 A218, D. Svoboda
IB000/18: Thu 10:00–11:50 C525, J. Lédl
IB000/19: Fri 8:00–9:50 B410, D. Velan
IB000/20: Fri 8:00–9:50 C416, A. Tran
IB000/21: Fri 10:00–11:50 A320, J. Obdržálek
IB000/22: Fri 10:00–11:50 A217, P. Matula
IB000/23: Fri 10:00–11:50 B204, V. Suchánek
IB000/24: Fri 10:00–11:50 C525, J. Kadlecaj
IB000/25: Fri 12:00–13:50 B411, J. Kadlecaj
- 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 58 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