| Course title | Discrete Mathematics 2 |
|---|---|
| Course code | KMI/YDMII |
| Organizational form of instruction | Lecture + Lesson |
| Level of course | Bachelor |
| Year of study | not specified |
| Semester | Winter |
| Number of ECTS credits | 6 |
| Language of instruction | English |
| Status of course | unspecified |
| Form of instruction | unspecified |
| Work placements | unspecified |
| Recommended optional programme components | None |
| Course availability | The course is available to visiting students |
| Lecturer(s) |
|---|
|
| 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) |
| Learning outcomes |
|
The course is a continuation of DMIA. 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 linear recurrence relations as well. The course is performed in English.
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. The students fulfill all their duties in English. |
| 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 |
|
Combined exam, Test
Active attendance on the seminars (100 %). Two credit tests - minimum 55% of points each. Written exam test at minimum 55% of points. |
| Recommended literature |
|
| Study plans that include the course |
| Faculty | Study plan (Version) | Category of Branch/Specialization | Recommended semester |
|---|