Syllabus
V předmětu budou probrána následující témata:
Dirichletův princip
Permutace bez opakování
Kombinace bez opakování
Variace bez opakování
Permutace s opakováním
Kombinace s opakováním
Variace s opakováním
Diskrétní pravděpodobnost
Závislé a nezávislé jevy
Grafy - základní pojmy
Grafové algoritmy I
Grafové algoritmy II
Annotation
The aim of the course is to acquaint future teachers with the basic concepts of discrete mathematics - combinatorics and graph theory, including application problems. After completing the course, the student should be able to solve combinatorial problems at the secondary school level (including examples from the Mathematical Olympiad) and apply basic graph algorithms. At the same time, he should be able to use mathematical software to solve these types of problems and to graphically represent graphs.
Introduction, Dirichlet's principle
Permutation without repetition
Combination without repetition
Variation without repetition
Permutation with repetition
Combination with repetition
Variation with repetition
Discrete probability
Dependent and independent phenomena
Graphs - basic concepts
Graph algorithms I
Graph algorithms II