|
|
|
||
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
Last update: TAJ413 (17.12.2013)
|
|
||
General skills: 1. basic terms in discrete mathematics 2. knowledge and understanding of basic algorithms 3. individual problem solving Last update: TAJ413 (05.09.2013)
|
|
||
R: Turzík, Pavlíková: Diskrétní matematika, skripta, VŠCHT Praha, 2007, ISBN:978-80-7080-667-8 Last update: TAJ413 (05.09.2013)
|
|
||
Lectures and seminars Last update: VED413 (04.09.2013)
|
|
||
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: VED413 (04.09.2013)
|
|
||
http://www.vscht.cz/mat/ZMO/Kap3.mws http://teorie-grafu.cz/ Last update: VED413 (04.09.2013)
|
|
||
Mathenatics I Last update: VED413 (04.09.2013)
|
Teaching methods | ||||
Activity | Credits | Hours | ||
Účast na přednáškách | 1 | 28 | ||
Příprava na přednášky, semináře, laboratoře, exkurzi nebo praxi | 0.5 | 14 | ||
Příprava na zkoušku a její absolvování | 1 | 28 | ||
Účast na seminářích | 0.5 | 14 | ||
3 / 3 | 84 / 84 |
Coursework assessment | |
Form | Significance |
Regular attendance | 50 |
Examination test | 50 |