|Course title||Discrete Mathematics I|
|Organizational form of instruction||Lecture + Lesson|
|Level of course||Bachelor|
|Year of study||1|
|Semester||Winter and summer|
|Number of ECTS credits||6|
|Language of instruction||Czech|
|Status of course||Compulsory|
|Form of instruction||Face-to-face|
|Work placements||This is not an internship|
|Recommended optional programme components||None|
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
|Learning activities and teaching methods|
|Monologic (reading, lecture, briefing)|
The course is targeted at the fundamental combinatorial reasoning. Basic concepts, methods and models of Discrete Mathematics are explained. Finally, the applications on word problems are practised.
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.
|Assessment methods and criteria|
Active attendance at seminars (100 %). Two credited tests - minimum 55% of points each. Written exam test at minimum 55% of points.
|Study plans that include the course|
|Faculty||Study plan (Version)||Category of Branch/Specialization||Recommended year of study||Recommended semester|
|Faculty: Faculty of Education||Study plan (Version): information technology and e-learning (2)||Category: Pedagogy, teacher training and social care||1||Recommended year of study:1, Recommended semester: Summer|