Discrete Mathematics

Major: System Analysis
Code of subject: 6.124.00.O.003
Credits: 6.00
Department: Information Systems and Networks
Lecturer: Ph.D., Associate Professor V.A. Vysotska
Semester: 1 семестр
Mode of study: денна
Learning outcomes: • fundamentals of mathematical logic, sets and methods of proof; • main tasks of combinatorics and methods of their solution; • basic concepts of the theory of relations; • basic concepts of graph theory and methods for solving problems with graphs; • basic theory of trees, processing methods, algorithms tree; • basic concepts and properties of Boolean functions; • basic concepts Languages, Grammars, and Machines; • basic theory of algorithms; • basics of coding theory.
Required prior and related subjects: • Algorithmization and Programming; • Mathematical Analysis
Summary of the subject: Logic and methods of proof. Sets and Relations. Combinatorics. Graphs. Trees. Boolean functions. Languages, Grammars and Machines. Basic theory of algorithms. Basic coding theory.
Assessment methods and criteria: • Current control (30%): written reports on laboratory work, oral examination; • Final control (70% of exam): in written.
Recommended books: • Нікольський Ю.В., Пасічник В.В., Щербина Ю.М. Дискретна математика. – Львів.: Видавництво "Магнолія-2006", 2009. – 432 с. • Капітонова Ю.В., Кривий С.Л., Летичевський О.А., Луцький Г.М., Печурін М.К. Основи дискретної математики. – К.: Наукова думка, 2002. – 580 с. • С.В.Яблонский. Введение в дискретную математику. 2-е изд. М., Наука, 1986. • В.Липский. Комбинаторика для программистов. М.: Мир, 1988. • В.А.Емеличев, О.И.Мельников, В.И.Сарванов, Р.И.Тышкевич. Лекции по теории графов. М., Наука. 1990. • О.П.Кузнецов, Г.М.Адельсон-Вельский. Дискретная математика для инженера. М.: Энергоатомиздат,1988. • Г.П.Гаврилов, А.А.Сапоженко. Сборник задач по дискретной математике. М.: Наука,1977.