Discrete Models in System Design

Major: Computer Science (Design and programming of intelligent systems and devices)
Code of subject: 6.122.12.E.078
Credits: 5.00
Department: Computer-Aided Design
Lecturer: Volodymyr Karkulovskyy
Semester: 8 семестр
Mode of study: денна
Learning outcomes: • knowledge of the theoretical foundations of discrete mathematics, taking into account the peculiarities of modern information technology; • knowledge of the main problems that can be solved using graph models; • knowledge of algorithms for implementing graph models to solve applied problems in computer-aided design; • knowledge of modern methods and tools that allow you to effectively implement graph models to solve specific problems. • ability to use graph models to solve computer-aided design problems; • ability to select the most effective algorithms to solve the problem and implement them using modern information technology; • possession of skills to independently solve non-standard professional tasks, to think alternatively, to constantly strive to improve professional activity.
Required prior and related subjects: Discrete Mathematics Algorithmization and Programming
Summary of the subject: The discipline involves mastering the knowledge of the principles and requirements for algorithms that implement graph models, ways to implement them, taking into account the peculiarities of information technology design. Gain the ability to use basic methods and tools and modern software systems and technologies for a wide range of tasks.
Assessment methods and criteria: Current control is carried out in the form of assessments for the protection of laboratory work and calculation and graphic work. Examination control is carried out on the basis of written work and oral examination. Current control - 40 points. Examination control - 60 points.
Recommended books: 1. Дискретна математика для програмістів: навч. посібник / Л.М.Журавчак. – Львів: Видавництво Львівської політехніки, 2019.-420 с. 2. Андрійчук Ю.В., Комарницький М.Я., Іщук Ю.Б., Вступ до дискретної математики. –– Львів: ВЦ ЛНУ ім. Івана Франка, 2003.–254с. 3. М. Ядренко. Дискретна математика: Навч.-метод. посібник. – К. : ТВіМС, 2004.- 244с. 4. Остин Оре Теория графов. –М.: Либроком, 2009. – 354с. 5. Касьянов В.Н. Графы в программировании: обработка, визуализация и применение / В.Н. Касьянов, В.А. Евстигнеев. – СПб.:БХВ-Петербург, 2003. – 1104 с. 6. Боднарчук Ю.В., Олійник Б.В. Основи дискретної математики: Навч. посіб. – К. : Вид. дім дім “Києво-Могилянська Академія“, 2009 7. Р. Грэхем, Д. Кнут, О. Паташник. Конкретная математика. –Москва: Мир, 1998 8. А.Я. Оленко, М.Й. Ядренко Дискретна математика. Навчально-методичний посібник, Видавництво НаУКМА-1996. . 9. Д.В. Карпов Теория графов https://logic.pdmi.ras.ru/~dvk/graphs_dk.pdf 10. Робин Уилсон Введение в теорию графов. К.: Диалектика, 2019. 240с. 11. Дональд Кнут Исскуство программирования. К.: Диалектика, 2020. 720с. 12. Харари Ф. Теория графов. М.: Мир, 1973. — 300 с. 13. http://www.cyb.univ.kiev.ua/library/books/karnaukh-23.pdf 14. https://ela.kpi.ua/bitstream/123456789/35854/1/Teoriia_hrafiv.pdf 15. https://www.alfasoft.com/en/products/development-tools/embarcadero/rad-studio.html