Discrete Mathematics

Course: Information Security of Telecommunication Systems and Networks

Structural unit: Faculty of Radiophysics, Electronics and Computer Systems

Title
Discrete Mathematics
Code
ВБ 2.02
Module type
Вибіркова дисципліна для ОП
Educational cycle
First
Year of study when the component is delivered
2023/2024
Semester/trimester when the component is delivered
4 Semester
Number of ECTS credits allocated
5
Learning outcomes
Doing tasks with suitable mathematical methods, checking the conditions of mathematical statements, correctly transfer the conditions and statements to new classes of objects, finding and analyzing the correspondences between the set task and known models. Know the mathematical theories and methods of Discrete Mathematics used in the field of radio engineering, electronics and telecommunications. Choose and use methods and tools of modeling. Make decisions both independently and in a team.
Form of study
Full-time form
Prerequisites and co-requisites
Know the basics of elementary Algebra and Geometry. Have basic theoretical positions and methods of Higher Mathematics, including the basics of Linear Algebra, numerical sequence theory, differential calculus. Be able to set mathematical tasks, to identify appropriate approaches to their solution and to use the necessary mathematical methods in each case.
Course content
The program of the discipline considers the issues and methods of combinatorial analysis, the basic concepts and results of graph theory, combinatorial sequences. In the application of Discrete Mathematics, a special place is occupied by tasks related to the development of technical devices with a discrete principle of operation, with the ordering of certain objects or actions, construction of complex structures, telecommunications systems and networks by optimal combination of individual elements. Rational organization of computer algorithms and programs in computer science and programming belong toDiscrete Mathematics.
Recommended or required reading and other learning resources/tools
1. Ядренко М. Й. Дискретна математика: навчальний посібник. – К.: МП «ТВіМС», 2004. – 245 с. 2. Grimaldi R. P. Descrete and combinatorical mathematics. Pearson. Addison Wisley, 2004.– 1006pp. 3. Jon Pierre Fortney. Discrete mathematics for computer science: an example-based introduction. – CRC Press, 2021. – 257 pp. 4. Susanna S.Epp. Discrete mathematics with applications.5th Edition. - CengageLearningIndiaPvt. Ltd., 2020. – 1056 pp.
Planned learning activities and teaching methods
Lectures – 34 hours. Practical classes – 40hours.Consultancy – 1 hour.Individual work – 75hours. The semester has three Modules.
Assessment methods and criteria
Semester assessment. 60 points maximum / 36 points minimum. The level of achievement of all planned learning outcomes is determined by the results of doing written module tests. The final assessment is carried out by conducting an examination. The form of the exam is written and oral. In total, you can get from 0 to 40 points for the exam. The condition for achieving a positive grade for the discipline is to obtain at least 60 points.
Language of instruction
Ukrainian

Lecturers

This discipline is taught by the following teachers

Departments

The following departments are involved in teaching the above discipline