About this subject
Credits
5
Workload
90hours
Semester
Autumn
Academic year
2
Description
The course aims to develop students’ theoretical knowledge and analytical skills in the fundamental concepts and methods of discrete mathematics. The course covers mathematical logic and predicate logic, sets and relations, Boolean algebra, fundamentals of combinatorics, and graph theory. The principles of properly formulating mathematical concepts, logically analyzing propositions, and applying various proof techniques are examined. Boolean functions, their decompositions, completeness and closure concepts, multivalued functions, operations on graphs, paths and chains in graphs, connectivity, and other fundamental graph concepts are studied. The application of discrete mathematics methods in computing technologies, automata theory, coding, information transmission and processing, and the development of algorithms and optimal software solutions is considered. Particular attention is given to the application of graph theory in network security and cyber forensics. The course is designed to develop students’ ability to analyze mathematical texts, construct logical arguments, apply theoretical knowledge to practical problems, and model computational and information security problems using discrete structures.
Course learning outcomes
No learning outcomes have been added.