|
Lecturer(s)
|
|
|
|
Course content
|
1 - Hypergraphs; 2 - Relations; 3 - Relational Objects; 4 - Mappings; 5 - Colouring and copying; 6 - Theorem on the Number of Copies with Applications; 7 - Systems of Transformations; 8 - Cayley Table; 9 - Combinatorial Principles 1; 10 - Combinatorial Principles 2; 11 - Chosen Combinatorial Models; 12 - Binomial and Multinomial Theorems; 13 - Word Problems; LMS MOODLE:
|
|
Learning activities and teaching methods
|
Monologic (reading, lecture, briefing), Dialogic (discussion, interview, brainstorming)
- Preparation for classes
- 51 hours per semester
- Class attendance
- 42 hours per semester
- Preparation for credit
- 40 hours per semester
- Preparation for exam
- 35 hours per semester
|
|
Learning outcomes
|
The course is targeted at fundamental combinatorial reasoning. Basic concepts, methods and models of discrete mathematics are explained. Finally, applications on word problems are practised. The course is performed in English.
The student understands the basic concepts and principles of discrete mathematics. On a variety of word problems, he/she demonstrates the utilization of the fundamental techniques of combinatorial calculations. The students fulfill all their duties in English.
|
|
Prerequisites
|
Mathematics I (MATEA, MATI, MATIA).
|
|
Assessment methods and criteria
|
Combined exam, Test
Active attendance on the seminars (100 %). Two credit tests - minimum 55% of points each. Written exam test - 4 word problems.
|
|
Recommended literature
|
-
Kurgalin, S., Borzunov, S. Discrete Math Workbook. Springer, 2018. ISBN 3319926446.
-
Matoušek, J., Nešetřil, J. Invitation to Discrete Mathematics. Oxford, 1998. ISBN 0-19-850207-9.
-
Nýdl, V., Thatte, B.D. a kol. Seminář z diskrétní matematiky 1 - Seminar in Discrete Mathematics 1. České Budějovice, 2011. ISBN 978-80-7394-327-1.
-
Rosen, K. H. Discrete Mathematics and Its Applications. New York: McGraw-Hill, 1988.
|