FI:IB000 Math. Foundations of CS - Course Information
IB000 Mathematical Foundations of Computer Science
Faculty of InformaticsAutumn 2014
- Extent and Intensity
- 2/1. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).
- Teacher(s)
- prof. RNDr. Petr Hliněný, Ph.D. (lecturer)
doc. Mgr. Jan Obdržálek, PhD. (seminar tutor)
RNDr. Ondrej Moriš (assistant)
RNDr. Jakub Gajarský, Ph.D. (seminar tutor)
Mgr. Marek Derňár (assistant)
Bc. Tomáš Lamser (seminar tutor)
RNDr. Jaroslav Čechák, Ph.D. (seminar tutor)
RNDr. Martin Laštovička, Ph.D. (seminar tutor)
Bc. Miloš Lukačka (assistant)
Mgr. Richard Trembecký (seminar tutor)
Mgr. Lukáš Másilko (seminar tutor)
Mgr. Jana Baranová (seminar tutor)
Mgr. Michal Kotrbčík, Ph.D. (seminar tutor)
Mgr. Jakub Lédl (seminar tutor)
Bc. Tomáš Novotný (seminar tutor)
Alexandru Popa, Ph.D. (seminar tutor)
Mgr. Michal Románek (seminar tutor)
Mgr. Ondřej Slámečka (seminar tutor) - 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 - Timetable
- Thu 12:00–13:50 D1, Thu 12:00–13:50 D3
- Timetable of Seminar Groups:
IB000/E1: each even Tuesday 12:00–13:50 C525, A. Popa
IB000/E2: each odd Tuesday 12:00–13:50 C525, A. Popa
IB000/T01: Thu 25. 9. to Fri 19. 12. Fri 8:00–9:35 Učebna S10 (56), L. Másilko, Nepřihlašuje se. Určeno pro studenty se zdravotním postižením.
IB000/03: each even Tuesday 14:00–15:50 A319, O. Slámečka
IB000/04: each odd Tuesday 14:00–15:50 A319, O. Slámečka
IB000/05: each even Monday 8:00–9:50 C511, J. Lédl
IB000/06: each odd Monday 8:00–9:50 C511, J. Lédl
IB000/07: each even Wednesday 8:00–9:50 A218, M. Kotrbčík
IB000/08: each odd Wednesday 8:00–9:50 A218, T. Novotný
IB000/09: each even Wednesday 10:00–11:50 B411, M. Románek
IB000/10: each odd Wednesday 10:00–11:50 B411, M. Románek
IB000/11: each even Monday 14:00–15:50 A217, M. Laštovička
IB000/12: each odd Monday 14:00–15:50 A217, M. Laštovička
IB000/13: each even Thursday 8:00–9:50 A319, R. Trembecký
IB000/14: each odd Thursday 8:00–9:50 A319, R. Trembecký
IB000/15: each even Tuesday 8:00–9:50 A319, M. Kotrbčík
IB000/16: each odd Tuesday 8:00–9:50 A319, M. Kotrbčík
IB000/17: each even Monday 10:00–11:50 C511, J. Obdržálek
IB000/18: each odd Monday 10:00–11:50 C511, J. Obdržálek
IB000/19: each even Friday 12:00–13:50 A218, J. Čechák
IB000/20: each odd Friday 12:00–13:50 A218, J. Čechák
IB000/21: each even Tuesday 16:00–17:50 B410, J. Gajarský
IB000/22: each odd Tuesday 16:00–17:50 B410, J. Gajarský
IB000/23: each even Monday 12:00–13:50 A319, T. Novotný - 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; 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.
- Syllabus
- The course focuses on understanding basic mathematical tools:
- Basic formalisms - statements, proofs, and propositional logic.
- Proof techniques, mathematical induction.
- Sets, relations, and functions.
- Binary relations, equivalence.
- Partial orderings and closures.
- Properties of functions, composition.
- Basics of graphs, connectivity, trees.
- Graph searching, distance, spanning trees.
- Directed graphs, network flows.
- Proof techniques for algorithms, induction.
- Advanced proof techniques for algorithms.
- Infinite sets and the halting problem.
- Literature
- recommended literature
- HLINĚNÝ, Petr. Úvod do informatiky. Elportál. Brno: Masarykova univerzita, 2010. ISSN 1802-128X. URL info
- MATOUŠEK, Jiří and Jaroslav NEŠETŘIL. Kapitoly z diskrétní matematiky. 3., upr. a dopl. vyd. V Praze: Karolinum, 2007, 423 s. ISBN 9788024614113. info
- Teaching methods
- This subject has regular weekly lectures and compulsory bi-weekly 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 voluntary 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
- Czech
- 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
- http://is.muni.cz/el/1433/podzim2013/IB000/index.qwarp
- Enrolment Statistics (Autumn 2014, recent)
- Permalink: https://is.muni.cz/course/fi/autumn2014/IB000