|
|
|
||
Last update: Kubová Petra Ing. (01.05.2019)
|
|
||
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 |
|
||
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 |
|
||
Last update: Kubová Petra Ing. (01.05.2019)
http://www.vscht.cz/mat/ZMO/Kap3.mws http://teorie-grafu.cz/ |
|
||
Last update: Kubová Petra Ing. (01.05.2019)
Lectures and seminars |
|
||
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. 7.Trees. 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. |
|
||
Last update: Maxová Jana RNDr. Ph.D. (14.05.2019)
Mathenatics I or Mathenatics A |
|
||
Last update: Maxová Jana RNDr. Ph.D. (14.05.2019)
Předmět je zakončen testem, na jehož základě bude udělen klasifikovaný zápočet. |
Coursework assessment | |
Form | Significance |
Regular attendance | 30 |
Examination test | 70 |