Course objectives:
|
The state examination in Discrete Mathematics verifies understanding of concepts and relationships in the field and student's ability of active application of basic methods in Discrete Mathematics, Graph Theory and Combinatorial Optimization, and has a general overview of algorithmic aspects and computational complexity of basic problems in the field. Emphasis is given on understanding relations between particular concepts. The exam also verifies level of mathematical thinking and culture of presentation.
|
Requirements on student
|
Passing all prerequisite courses.
|
Content
|
Final state examination is an oral exam, consisting in a presentation in front of a jury. Usual duration of about 30-45 minutes total, with 15 minutes for eaxh partial exam. Main contents of the state exam generally corresponds to the prerequisite courses. Detailed contents is annually published by the Department of Mathematics.
|
Activities
|
|
Fields of study
|
|
Guarantors and lecturers
|
|
Literature
|
-
Recommended:
Literatura je dána literaturou podmiňujících předmětů a doporučením garanta oboru./ Literature as given by the conditional courses and recommended by the course guarantor..
-
On-line library catalogues
|
Prerequisites
|
Knowledge - students are expected to possess the following knowledge before the course commences to finish it successfully: |
The student has to pass successfully all prerequisite courses.
KMA/TGD1, KMA/TGD2, KMA/MSR, KMA/AVS nebo KMA/KO |
|
Learning outcomes
|
Knowledge - knowledge resulting from the course: |
Passing the final state examination in Discrete Mathematics verifies that the student has obtained knowledge, skills and competences in Discrete Mathematics, Graph Theory, Combinatorial Optimization and Computational Complexity. |
|
Assessment methods
|
Knowledge - knowledge achieved by taking this course are verified by the following means: |
Oral exam |
|
Teaching methods
|
|