IB000 Mathematical Foundations of Computer Science

Faculty of Informatics
Autumn 2012
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)
RNDr. Ondrej Moriš (seminar tutor)
RNDr. Jakub Gajarský, Ph.D. (seminar tutor)
Bc. Petr Boroš (seminar tutor)
Mgr. Matěj Klusáček (seminar tutor)
Mgr. Marek Tomáštík (seminar tutor)
Mgr. Vojtěch Havel (seminar tutor)
Mgr. Dušan Švancara (seminar tutor)
Mgr. Pavla Kratochvílová (seminar tutor)
RNDr. Martin Laštovička (seminar tutor)
Mgr. Petra Ovesná, Ph.D. (seminar tutor)
Mgr. Lukáš Másilko (seminar tutor)
Mgr. et Mgr. Martin Derka, M.Sc. (seminar tutor)
Mgr. Marek Derňár (seminar tutor)
Reshma Ramadurai, PhD. (seminar tutor)
RNDr. Libor Škarvada (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
Mon 8:00–9:50 D2, Mon 8:00–9:50 D1, Mon 8:00–9:50 D3
  • Timetable of Seminar Groups:
IB000/T01A: Mon 14:00–15:55 Učebna S10 (56), L. Másilko
IB000/T01AA: Wed 19. 9. to Fri 21. 12. Wed 12:00–13:55 Učebna S10 (56), L. Másilko
IB000/T02: Tue 18. 9. to Fri 21. 12. Tue 12:00–13:55 Učebna S11 (58), L. Másilko
IB000/01: each even Wednesday 12:00–13:50 G126, P. Hliněný
IB000/02: each odd Wednesday 12:00–13:50 G126, R. Ramadurai
IB000/03: each even Monday 10:00–11:50 G126, M. Derka
IB000/04: each odd Monday 10:00–11:50 G126, M. Derka
IB000/05: each even Monday 12:00–13:50 C511, M. Klusáček
IB000/06: each odd Monday 12:00–13:50 C511, M. Klusáček
IB000/07: each even Tuesday 16:00–17:50 B410, O. Moriš
IB000/08: each odd Tuesday 16:00–17:50 B410, O. Moriš
IB000/09: each even Tuesday 18:00–19:50 B410, M. Derňár
IB000/10: each odd Tuesday 18:00–19:50 B410, M. Derňár
IB000/11: each even Wednesday 10:00–11:50 G123, J. Gajarský
IB000/12: each odd Wednesday 10:00–11:50 G123, J. Gajarský
IB000/13: each even Wednesday 18:00–19:50 G101, P. Boroš
IB000/14: each odd Wednesday 18:00–19:50 G101, P. Boroš
IB000/15: each even Friday 12:00–13:50 G126, P. Kratochvílová
IB000/16: each odd Friday 12:00–13:50 G126, P. Kratochvílová
IB000/17: each even Friday 14:00–15:50 G126, L. Škarvada
IB000/18: each odd Friday 14:00–15:50 G126, L. Škarvada
IB000/19: each even Friday 16:00–17:50 G126, L. Škarvada
IB000/20: each odd Friday 16:00–17:50 G126, L. Škarvada
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
    required literature
  • HLINĚNÝ, Petr. Úvod do informatiky. Elportál. Brno: Masarykova univerzita, 2010. ISSN 1802-128X. URL info
    recommended literature
  • 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. All the details can be found in IS syllabus and on the web page. 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
The course is taught annually.
Listed among pre-requisites of other courses
Teacher's information
http://is.muni.cz/el/1433/podzim2012/IB000/index.qwarp
The course is also listed under the following terms Autumn 2002, Autumn 2003, Autumn 2004, Autumn 2005, Spring 2006, Autumn 2006, Autumn 2007, Spring 2008, Autumn 2008, Autumn 2009, Autumn 2010, Autumn 2011, Autumn 2013, Autumn 2014, Autumn 2015, Autumn 2016, Autumn 2017, Autumn 2018, Autumn 2019, Autumn 2020, Autumn 2021.
  • Enrolment Statistics (Autumn 2012, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2012/IB000