Discrete mathematics
Course: Applied Programming
Structural unit: Faculty of information Technology
Title
Discrete mathematics
Code
ОК 4
Module type
Обов’язкова дисципліна для ОП
Educational cycle
First
Year of study when the component is delivered
2021/2022
Semester/trimester when the component is delivered
1 Semester
Number of ECTS credits allocated
4
Learning outcomes
Know the basic forms and laws of abstract logical thinking, the basics of logic, the basic concepts of set theory, correspondences, relations, functions, combinatorics, logical functions, Boolean functions. To know the theoretical and applied principles of discrete analysis, the theory of graphs, trees, the theory of coding, the theory of automata. Be able to acquire systematic knowledge in the field of computer science, analyze problems from the point of view of modern scientific paradigms, be able to effectively use modern mathematical apparatus in professional activities, solve set theory problems, combinatorial problems, minimize conjunctive and disjunctive normal forms of Boolean functions, determine the completeness of the system of Boolean functions, find the relationship between the characteristics of graphs, determine the Eulerianness and Hamiltonianity of graphs. Communicate to exchange of logical arguments for the analysis, synthesis and design of automata.
Form of study
Full-time form
Prerequisites and co-requisites
There are no prerequisites for the discipline.
Course content
The discipline covers the study of set theory and operations on them; correspondences and functions; relations; elements of general algebra and mathematical logic; logical functions; logic of predicates; combinatorics; trees and graphs, automata, etc.
Recommended or required reading and other learning resources/tools
1. Discrete Mathematics and Its Applications Kenneth H. Rosen. McGraw-Hill, 1221
Avenue of the Americas, New York, NY 10020, 2007. 1071 р.
Planned learning activities and teaching methods
Lectures, practical activities, individual task and work
Assessment methods and criteria
The condition for receiving a positive final grade for a discipline is to achieve at least 60% of the maximum possible number of points - 60 points. The final number of points from the discipline (maximum 100 points) is determined as the sum of points for systematic work during the semester, taking into account two modular control papers and the defense of 13 practical papers. The maximum number of points that can be obtained by a student on the exam is 40 points. To receive a positive final grade, a student must obtain at least 24 points (60% of the maximum possible number of points) on the exam. The student is admitted to the exam on the condition that during the semester he successfully completes 2 control tasks and all the practical tasks provided for in the plan, which in the end should be at least the recommended minimum of 36 points (60% of the maximum possible number of points that the student can receive for work in the semester).
Language of instruction
Ukrainian
Lecturers
This discipline is taught by the following teachers
DEPARTMENT OF APPLIED INFORMATION SYSTEMS
Faculty of information Technology
Faculty of information Technology
Departments
The following departments are involved in teaching the above discipline
DEPARTMENT OF APPLIED INFORMATION SYSTEMS
Faculty of information Technology