SylabUZ
Course name | Discrete Mathematics 2 |
Course ID | 11.1-WK-MATEP-DM2-S22 |
Faculty | Faculty of Exact and Natural Sciences |
Field of study | Mathematics |
Education profile | academic |
Level of studies | First-cycle studies leading to Bachelor's degree |
Beginning semester | winter term 2022/2023 |
Semester | 4 |
ECTS credits to win | 5 |
Available in specialities | Mathematical computer science |
Course type | optional |
Teaching language | english |
Author of syllabus |
|
The class form | Hours per semester (full-time) | Hours per week (full-time) | Hours per semester (part-time) | Hours per week (part-time) | Form of assignment |
Lecture | 30 | 2 | - | - | Exam |
Class | 30 | 2 | - | - | Credit with grade |
Understanding advanced concepts of discrete mathematics from both theoretical and algorithmic perspectives.
Discrete Mathematics 1
Lecture/classes:
Lecture: conventional, conversational.
Classes: classical problem-solving method.
Outcome description | Outcome symbols | Methods of verification | The class form |
Conditions for passing classes and lectures:
The final grade for the course consists of the exercise grade (50%) and the lecture grade (50%). The condition for passing the course is obtaining positive passing grades for both exercises and the lecture.
H. L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth,Theoretical Computer Science 209 (1998) 1-45.
Modified by dr hab. Elżbieta Sidorowicz, prof. UZ (last modification: 12-01-2024 18:36)