Discrete Mathematics, Part 2

Major: Applied mathematics and computer science
Code of subject: 6.113.00.O.015
Credits: 4.00
Department: Applied Mathematics
Lecturer: Volodymyr R. Hladun
Semester: 3 семестр
Mode of study: денна
Learning outcomes: familiarize students with course units graph theory, basics of the theory of algorithms and formal languages, which are widely used in the design and development of mathematical and software of modern computers.
Required prior and related subjects: Prerequisites: Mathematical and computer software, Programming, Calculus, Algebra Corequisites: System programming
Summary of the subject: Following the completion of the module the student should: possess basic concepts of graph theory apparatus in terms of presentation and construction of optimal algorithms; prepare students to study courses "Methods of optimization", "System pro-gramming", "Systems Theory" by mastery of the theory of algorithms and algorithmic languages, constructing finite and MP-machines, grammars representation in present form.
Assessment methods and criteria: • Current control (40%): oral questioning, written tests. • Final control (60%): exam.
Recommended books: Горбатов В.А. Основи дискретной математики: Учебное пособие для студентов вузов. -М.: Высш.шк., 1986.-311 с. 2. Емеличев В.А. й др. Лекции по теории графов. -М.-'Наука", 1990.-384с. 3. Кук Д., Бейз Г. Компьютерная математика. -М.''Мир", 1990. –360 с. 4. Яблонский С.В. Введение в дискретную математику. -М.-'Наука", 1986.-384с