Studies > Discrete Mathematics (121 Software Engineering, High Performance Computing)

Discrete Mathematics (121 Software Engineering, High Performance Computing)

Type: Normative

Department: radiophysics and computer technologies

Curriculum

SemesterCreditsReporting
24Exam

Lectures

SemesterAmount of hoursLecturerGroup(s)
232Associate Professor Velhosh S. R.ФеП-11, ФеП-12, ФеП-13

Laboratory works

SemesterAmount of hoursGroupTeacher(s)
232ФеП-11Senior Researcher Serednytska  K. I., Associate Professor Sas Nataliya
ФеП-12Associate Professor Velhosh S. R., Senior Researcher Serednytska  K. I.
ФеП-13Associate Professor Velhosh S. R.

Опис навчальної дисципліни

The purpose of teaching the discipline “Discrete Mathematics” is to acquaint students with the theoretical foundations of mathematical logic, fuzzy logic, set theory, combinatorics, graph theory, data structures – linear and nonlinear lists (trees), as well as basic algorithms.

The task of the discipline “Discrete Mathematics” is to teach students to use methods of discrete mathematics (including methods of mathematical logic, fuzzy logic, set theory, combinatorics and graph theory) to formalize and solve applied problems and compose computer programs based on basic algorithms .

After studying the discipline, students must:

know:

theoretical and applied provisions of discrete analysis, including mathematical logic, set theory, fuzzy logic, combinatorics, graph theory, basic data structures.

be able:

effectively use the apparatus of discrete mathematics in professional activities to solve problems of theoretical and applied nature in the process of analysis, synthesis and design of information systems by industry.

Recommended Literature

Базова

  1. Нікольский Ю.В., Пасічник В.В., Щербина Ю.М. Дискретна математика. – К: Видавнича група BHV, 2007. – 368 с

Materials

Basic literature.

Nikolsky Y.V. Discrete mathematics: Textbook. Third edition, corrected and supplemented / Y. Nikolsky, V. Pasichnyk, Y. Shcherbyna – Lviv: Magnolia – 2006, 2013. 432 p.
Matvienko M. P. Discrete mathematics: textbook.
Bondarchuk Y. V. Fundamentals of discrete mathematics: a textbook / Y. V. Bondarchuk, B. V. Oliynyk. – Kyiv: Kyiv-Mohyla Academy Publishing House, 2009. 159 p.
Bondarenko M.F. Computer discrete mathematics / M.F. Bondarenko, N.V. Bilous, A.T. Rutkas – Kh.
Karnaukh T. O. Introduction to discrete mathematics / T. O. Karnaukh, A. B. Stavrovsky – K. : VPC “Kyiv University”, 2006. 113 p.
Yadrenko M.Y. Discrete mathematics: a textbook / M.Y. Yadrenko – Kyiv: VPC “Express”, 2003. 244 p.
Andriychuk V. Introduction to discrete mathematics: a textbook / V. Andriychuk, M. Komarnytskyi, Y. Ishchuk – Kyiv: Center for Educational Literature, 2004. 254 p.

 

 

 

Supporting literature.

A. Anderson. Discrete Mathematics with Combinatorics. – Prentice Hall, Upper Saddle River, New Jersey 07458.
H. Cormen, Ch. E. Leiserson, R. L. Rivest, C. Stein. Introduction to Algorithms. Third Edition. – The MITPress Cambridge, Massachusetts London, England.
V. Aho, J. E. Hopcroft, J. D. Ullman. Data structure and Algorithms. – Addison-Wesley.
Olenych I.B. Fuzzy logic and fuzzy modeling: a textbook / I.B. Olenych. Lviv: Ivan Franko National University of Lviv, 2022. 210 p.
Discrete Mathematics in Examples and Problems: a textbook / R.M. Trokhymchuk, M.S. Nikitchenko – Kyiv: Kyiv University, 2017. 248 p.
Mazurenko N.I. Collection of problems in discrete mathematics: Holinei O.M., 2016. 81 p.

Силабус:

Завантажити силабус