1 |
Title of discipline |
Discrete mathematics and graph theory |

2 |
Year of study |
3, Specialty “Computer mathematics and system analysis” |

3 |
Semester of study |
5 |

4 |
Number of credits |
4 |

5 |
Full name of lecturer |
Candidate of physical and mathematical sciences, Associate Professor Metelsky Yury Mikhailovich |

6 |
Objectives of studying the discipline |
Acquaintance with the problems and methods of discrete mathematics. Forming the skills of discrete mathematical thinking and the ability to apply it in solving specific problems. |

7 |
Prerequisites |
Initial information from the theory of mappings, set theory and linear algebra |

8 |
Content of discipline |
Elements of enumerative combinatorics. Introduction to the theory of Boolean functions. Fundamentals of graph theory and examples of its use for solving applied problems. |

9 |
Recommended literature |
1. Зуев Ю.А. По океану дискретной математики: От перечислительной комбинаторики до современной криптографии. В 2-х томах. М.: Книжный дом «Либроком», 2012. 2. Емеличев В.А., Мельников О.И., Сарванов В.И., Тышкевич Р.И. Лекции по теории графов. (Изд. второе, исправленное.) М.: Книжный дом «Либроком», 2009. 3. Емеличев В.А., Зверович И.Э., Мельников О.И., Сарванов В.И., Тышкевич Р.И. Теория графов в задачах и упражнениях (учебное пособие). М.: Книжный дом «Либроком», 2013. |

10 |
Teaching methods |
Reproductive (passive), visual, comparative, dialog-heuristic, problem, research |

11 |
Language of study |
Russian |

12 |
Current test activities |
Theoretical colloquiums, written test works |

13 |
Type of current certification |
Test, Exam |