Course: Discrete Mathematics II

« Back
Course title Discrete Mathematics II
Course code KMI/KDMII
Organizational form of instruction Lecture
Level of course Bachelor
Year of study 3
Semester Winter and summer
Number of ECTS credits 6
Language of instruction Czech
Status of course Compulsory-optional
Form of instruction unspecified
Work placements This is not an internship
Recommended optional programme components None
Lecturer(s)
  • Chládek Petr, Mgr. Ph.D.
Course content
1 - Graph Definition; 2 - Operations on Graphs; 3 - Walking on the Graph; 4 - Graph homomorphisms; 5 - Trees; 6 - Tree Coding; 7 - Spaning Trees; 8 - Greedy Algorithm; 9 - Shortest Path Problem; 10 - Generating Functions; 11 - Pólya Theorem; 12 - Recurrence Relations; 13 - Word Problems.

Learning activities and teaching methods
Monologic (reading, lecture, briefing), Dialogic (discussion, interview, brainstorming)
  • Class attendance - 18 hours per semester
  • Preparation for credit - 55 hours per semester
  • Preparation for classes - 50 hours per semester
  • Preparation for exam - 45 hours per semester
Learning outcomes
The course is a continuation of DMI. Its first part is targeted at the graph theory, including some chosen graph algorithms. Further, the theory of generating functions is performed with applications on word problems (the Pólya theorem) and the technique of solving the linear recurrence relations as well.
The student understands the fundamental concepts of the graph theory. He/she performs the basic graph operations and determines some typical parameters of the graph. He/she masters the Prüfer coding of the trees, the greedy, the Dijkstra and the Floyd algorithms, and, on a variety of word problems, demonstrates the use of the generating functions and the linear recurrence relations.
Prerequisites
Discrete mathematics I (DMI, DMIA).
KMI/CDMI
----- or -----
KMI/DMI
----- or -----
KMI/DMIA
----- or -----
KMI/KDMI
----- or -----
KMI/KDMIA
----- or -----
KMI/YDMI

Assessment methods and criteria
Oral examination, Written examination, Test

Active attendance on the seminars (100 %). The credit test - minimum 50% of points. Written exam test at minimum 50% of points.
Recommended literature
  • Matoušek, J., Nešetřil, J. Kapitoly z diskrétní matematiky.. Praha: Karolinum, 2007. ISBN 978-80-246-1411-3.
  • Nýdl, V. Diskrétní matematika v příkladech, díl 2.. České Budějovice: PF JU, 2007.
  • Rosen, K. H. Discrete Mathematics and Its Applications.. New York: McGraw-Hill, 2006. ISBN 0073229725 / 9780.


Study plans that include the course
Faculty Study plan (Version) Category of Branch/Specialization Recommended year of study Recommended semester
Faculty: Faculty of Economics Study plan (Version): Economic Informatics (4) Category: Economy 3 Recommended year of study:3, Recommended semester: Winter