DS1KIP - Combinatorics and Applications
Course specification | ||||
---|---|---|---|---|
Course title | Combinatorics and Applications | |||
Acronym | DS1KIP | |||
Study programme | Electrical Engineering and Computing | |||
Module | ||||
Type of study | doctoral studies | |||
Lecturer (for classes) | ||||
Lecturer/Associate (for practice) | ||||
Lecturer/Associate (for OTC) | ||||
ESPB | 9.0 | Status | elective | |
Condition | Mathematical education at the undergraduate level | |||
The goal | Acquiring knowledge of selected topics of combinatorics necessary in research in modern discrete mathematics and its applications in computer science and electrical engineering. | |||
The outcome | Students will be able to use methods of combinatorics in research and applications in discrete mathematics, computer science and electrical engineering. | |||
Contents | ||||
Contents of lectures | Introduction. Classical combinatorics. Finite geometries. Block-design. Association schemes. Codes. Latin squares. Hadamard matrices. System of distinct representatives. Matroids. Groups and combinatorial enumerations. Various aspects of applications of combinatorics in computer science and electrical engineering. | |||
Contents of exercises | ||||
Literature | ||||
| ||||
Number of hours per week during the semester/trimester/year | ||||
Lectures | Exercises | OTC | Study and Research | Other classes |
6 | ||||
Methods of teaching | Lectures. | |||
Knowledge score (maximum points 100) | ||||
Pre obligations | Points | Final exam | Points | |
Activites during lectures | Test paper | 70 | ||
Practical lessons | Oral examination | |||
Projects | ||||
Colloquia | ||||
Seminars | 30 |