FI:IB000 Math. Foundations of CS - Course Information
IB000 Mathematical Foundations of Computer Science
Faculty of InformaticsAutumn 2024
- 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).
- Teacher(s)
- prof. RNDr. Petr Hliněný, Ph.D. (lecturer)
Mgr. Jakub Balabán (seminar tutor)
RNDr. Nikola Beneš, Ph.D. (seminar tutor)
Filip Blažek (seminar tutor)
Bc. Samuel Čepela (seminar tutor)
Bc. Roman Dvořák (seminar tutor)
Mgr. Tomáš Foltýnek, Ph.D. (seminar tutor)
Adéla Heroudková (seminar tutor)
Bc. László Iván (seminar tutor)
Mgr. Jan Jedelský (seminar tutor)
RNDr. Martin Jonáš, Ph.D. (seminar tutor)
Bc. Tomáš Jusko (seminar tutor)
Karolína Kovácsová (seminar tutor)
Bc. Filip Kučerák (seminar tutor)
Marek Lukášík (seminar tutor)
doc. RNDr. Martin Maška, Ph.D. (seminar tutor)
doc. RNDr. Pavel Matula, Ph.D. (seminar tutor)
RNDr. Vít Musil, Ph.D. (seminar tutor)
doc. RNDr. Petr Novotný, Ph.D. (seminar tutor)
doc. Mgr. Jan Obdržálek, PhD. (seminar tutor)
Bc. Tai Phat Pham (seminar tutor)
Bc. Dávid Smolka (seminar tutor)
Bc. Adam Straka (seminar tutor)
doc. RNDr. David Svoboda, Ph.D. (seminar tutor)
Bc. Adéla Štěpková (seminar tutor)
Bc. Vojtěch Turland (seminar tutor)
Bc. Lukáš Bátora (assistant)
Bc. Tereza Kinská (assistant)
Bc. Matěj Pavlík (assistant)
Bc. Jindřich Sedláček (assistant)
Pavol Trnavský (assistant)
Bc. Anna Vítová (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 - Prerequisites
- !( IB000ext Math. Foundations of CS || NOW ( IB000ext Math. Foundations of CS ))
The course is intended primarily for students of Bachelor's degree programs at the Faculty of Informatics. Students with a minor plan in Informatics enroll in IB000ext. - 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
- Image Processing and Analysis (programme FI, N-VIZ)
- Bioinformatics and systems biology (programme FI, N-UIZD)
- Computer Games Development (programme FI, N-VIZ_A)
- Computer Graphics and Visualisation (programme FI, N-VIZ_A)
- Computer Networks and Communications (programme FI, N-PSKB_A)
- Cybersecurity Management (programme FI, N-RSSS_A)
- Formal analysis of computer systems (programme FI, N-TEI)
- Graphic design (programme FI, N-VIZ)
- Graphic Design (programme FI, N-VIZ_A)
- Hardware Systems (programme FI, N-PSKB_A)
- Hardware systems (programme FI, N-PSKB)
- Image Processing and Analysis (programme FI, N-VIZ_A)
- Information security (programme FI, N-PSKB)
- Informatics (programme FI, B-INF) (3)
- Informatics in education (programme FI, B-IVV) (2)
- Information Security (programme FI, N-PSKB_A)
- Quantum and Other Nonclassical Computational Models (programme FI, N-TEI)
- Cybersecurity (programme FI, B-CS)
- Computer graphics and visualisation (programme FI, N-VIZ)
- Computer Networks and Communications (programme FI, N-PSKB)
- Business Informatics (programme ESF, B-POIN)
- Principles of programming languages (programme FI, N-TEI)
- Programming and development (programme FI, B-PVA)
- Cybersecurity management (programme FI, N-RSSS)
- Services development management (programme FI, N-RSSS)
- Software Systems Development Management (programme FI, N-RSSS)
- Services Development Management (programme FI, N-RSSS_A)
- Software Systems Development Management (programme FI, N-RSSS_A)
- Software systems (programme FI, N-PSKB)
- Machine learning and artificial intelligence (programme FI, N-UIZD)
- Teacher of Informatics and IT administrator (programme FI, N-UCI)
- Informatics for secondary school teachers (programme FI, N-UCI) (2)
- Computer Games Development (programme FI, N-VIZ)
- Processing and analysis of large-scale data (programme FI, N-UIZD)
- Natural language processing (programme FI, N-UIZD)
- 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 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 and relevant proofs.
- Syllabus
- The course focuses on understanding basic mathematical tools:
- Basic formalisms - statements, proofs, and propositional logic.
- Introduction to predicate logic, quantifiers.
- 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, subgraphs, directed graphs.
- Graph connectivity and distance, trees, and spanning trees.
- Infinite sets and the halting problem.
- 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 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 these three parts: through term evaluation (minimal score is required), "computer" written exam (again, minimal score is required), and an optional classical written exam.
- Language of instruction
- Czech
- Further comments (probably available only in Czech)
- Study Materials
The course is taught annually.
The course is taught: every week. - Listed among pre-requisites of other courses
- Teacher's information
- http://is.muni.cz/el/1433/podzim2024/IB000/index.qwarp
- Enrolment Statistics (recent)
- Permalink: https://is.muni.cz/course/fi/autumn2024/IB000