SubjectsSubjects(version: 947)
Course, academic year 2021/2022
Discrete Mathematics - B413011
Title: Diskrétní matematika
Guaranteed by: Department of Mathematics, Informatics and Cybernetics (446)
Faculty: Faculty of Chemical Engineering
Actual: from 2021 to 2021
Semester: summer
Points: summer s.:3
E-Credits: summer s.:3
Examination process: summer s.:
Hours per week, examination: summer s.:2/1, MC [HT]
Capacity: unlimited / unlimited (unknown)
Min. number of students: unlimited
Language: Czech
Teaching methods: full-time
Teaching methods: full-time
For type:  
Additional information:
Note: course can be enrolled in outside the study plan
enabled for web enrollment
Guarantor: Maxová Jana RNDr. Ph.D.
Class: Předměty pro matematiku
Interchangeability : N413018
This subject contains the following additional online materials
Annotation -
Last update: Kubová Petra Ing. (01.05.2019)
The subject is designed for all students in bachelor programmes, especially aimed at informatics. Students learn basic notions and algorithms in discrete mathematics which are used in informatics
Aim of the course -
Last update: Kubová Petra Ing. (01.05.2019)

General skills:

1. basic terms in discrete mathematics

2. knowledge and understanding of basic algorithms

3. individual problem solving

Literature -
Last update: Kubová Petra Ing. (01.05.2019)

R: Turzík, Pavlíková: Diskrétní matematika, skripta, VŠCHT Praha, 2007, ISBN:978-80-7080-667-8

Learning resources -
Last update: Kubová Petra Ing. (01.05.2019)

Teaching methods -
Last update: Kubová Petra Ing. (01.05.2019)

Lectures and seminars

Syllabus -
Last update: Kubová Petra Ing. (01.05.2019)

1.Sets, relations, posets.

2.Basic combinatorial notions.

3.Counting of objects.

4.Logics. Boolean functions.

5.Finite fields

6.Basic notions of graph theory.


8.Paths in graphs. The shortest path in a graph.

9.Euler and Hamiltonian graphs.

8.Spanning tree and greedy algorithm.

9.Quick sorting.

10.Plannar graphs and their charecterization.

11.Coloring of graphs.

12.Four colors problem.

13.Polynomial and exponential algorithms. Classes P, NP and co-NP.

14.Application of graph theory in theory of games. Game NIM and winning strategy.

Registration requirements -
Last update: MAXOVAJ (14.05.2019)

Mathenatics I or Mathenatics A

Course completion requirements - Czech
Last update: MAXOVAJ (14.05.2019)

Předmět je zakončen testem, na jehož základě bude udělen klasifikovaný zápočet.