česky | **in English**

Autumn 2016

**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).
**Teacher(s)**- prof. RNDr. Petr Hliněný, Ph.D. (lecturer)

doc. Mgr. Jan Obdržálek, PhD. (seminar tutor)

Mgr. David Klaška (seminar tutor)

Dr. rer. nat. Achim Blumensath (seminar tutor)

doc. RNDr. Jan Bouda, Ph.D. (seminar tutor)

Frédéric Dupont Dupuis, Ph.D. (seminar tutor)

doc. RNDr. Pavel Matula, Ph.D. (seminar tutor)

doc. RNDr. Petr 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. Luděk Matyska (seminar tutor)

RNDr. Adam Rambousek, Ph.D. (seminar tutor)

Mgr. Jaroslav Čechák (seminar tutor)

Bc. Matúš Bezek (seminar tutor)

Bc. Matúš Hlaváčik (seminar tutor)

Bc. Michal Korbela (seminar tutor)

Bc. Jakub Lédl (seminar tutor)

Bc. Tomáš Novotný (seminar tutor)

Mgr. Jana Baranová (assistant)

Bc. Ondřej Darmovzal (assistant)

Pavel Ježek (assistant)

Bc. Filip Opálený (assistant)

Bc. Michal Románek (assistant)

Mgr. Bc. Dominik Velan (assistant) **Supervisor**- 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**- Tue 10:00–11:50 D1, Tue 10:00–11:50 D3
- Timetable of Seminar Groups:

*D. Klaška*

IB000/A2: Wed 10:00–11:50 C416,*D. Klaška*

IB000/E1: Tue 14:00–15:50 B411,*A. Blumensath*

IB000/E2: Mon 16:00–17:50 C511,*F. Dupont Dupuis*

IB000/01: Thu 10:00–11:50 C511,*J. Obdržálek*

IB000/02: Tue 12:00–13:50 A319,*J. Obdržálek*

IB000/03: Wed 8:00–9:50 C525,*M. Hlaváčik*

IB000/04: Wed 14:00–15:50 C525,*J. Bouda*

IB000/05: Tue 8:00–9:50 B410,*P. Matula*

IB000/06: Thu 12:00–13:50 B410,*P. Matula*

IB000/07: Mon 16:00–17:50 B410,*M. Maška*

IB000/08: Thu 8:00–9:50 C511,*D. Svoboda*

IB000/09: Tue 12:00–13:50 A217,*N. Beneš*

IB000/10: Mon 14:00–15:50 A320,*A. Rambousek*

IB000/11: Tue 14:00–15:50 C511,*L. Matyska*

IB000/12: Thu 18:00–19:50 C416,*M. Bezek*

IB000/13: Mon 18:00–19:50 C416,*J. Čechák*

IB000/14: Wed 18:00–19:50 B411,*J. Čechák*

IB000/15: Mon 14:00–15:50 B410,*T. Novotný*

IB000/16: Wed 8:00–9:50 B411,*T. Novotný*

IB000/17: Mon 18:00–19:50 C511,*M. Korbela*

IB000/18: Mon 12:00–13:50 A218,*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 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**- 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

*recommended literature*- HLINĚNÝ, Petr. Úvod do informatiky.
**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 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/podzim2015/IB000/index.qwarp

- Enrolment Statistics (Autumn 2016, recent)
- Permalink: https://is.muni.cz/course/fi/autumn2016/IB000

Go to top | Current date and time: 23. 10. 2018 18:18, Week 43 (odd)

Contact: