|
1 |
Name of the discipline |
Discrete Math |
|
2 |
Course of study |
1 |
|
3 |
Semester of training |
2 |
|
4 |
Amount of credits |
3 |
|
5 |
FULL NAME of lecturer | Candidate of physical and mathematical sciences,Senior LecturerTarazevich Yury Georgievich |
|
6 |
Objectives of the studydisciplines | Acquaintance with the problems and methods of discrete mathematics. Forming the skills of discrete mathematical thinking and the ability to apply it in solving specific problems.As a result of the study, the student should be able to:- formulate the main statements from the considered sections of discrete mathematics;- apply basic statements to solve typical problem |
|
7 |
Prerequisites | Initial information from set theory, algebra, and mathematical analysis |
|
8 |
Contentdisciplines | Elements of combinatorics. Algebra of logic. Graphs and networks. Elements of the theory of coding and the theory of control systems. |
|
9 |
Recommendedliterature | 1. S. Yablonsky, Introduction to Discrete Mathematics. M.: Science, 1986.2. K. Rybnikov, Introduction to combinatorial analysis. Moscow: MSU Publishing House, 1985.3. G. Gavrilov, A. Sapozhenko, Problems and exercises on discrete mathematics. M.: Nauka, 1992.4. V. Alekseev, S. Aleshin, V. Buevich, V. Kudryavtsev, A. Podkolzin, A. Sapozhenko, S. Yablonsky. Methodological development on the course “Mathematical logic and discrete mathematics”. Saratov University Press, 1982. |
|
10 |
Teaching methods | Reproductive (passive), visual, comparative, dialog-heuristic, problematic, research |
|
11 |
Language of instruction | Russian |
|
12 |
Conditions (requirements),routine control | Theoretical colloquium, written test work |
|
13 |
Current formattestation | Exam (current score, coefficient – 0.3,examination score, coefficient – 0.7) |