Faculty of BSU

1 |
Title discipline |
Discrete mathematics. |

2 |
Training course |
1, specialty “Economic activity”. |

3 |
Semester of training |
8 |

4 |
Number of credits |
3 |

5 |
Name and surname lecturer |
Doctor of Pedagogical Sciences, Professor Melnikov Oleg Isidorovich. |

6 |
Objectives of the study disciplines |
Introduction to the problems of discrete mathematics. Familiarity with graph theory. Acquaintance with combinatorics. Introduction to the theory of Boolean functions. Formation of methods for using discrete mathematics in the study of economic models. In the process of studying, the student should be able to: – formulate the main statements of the considered sections of discrete mathematics; – to solve specific tasks from the sections under consideration; – know the methodical methods of applying discrete mathematics in the study of economic models. |

7 |
Prerequisites |
Initial information from set theory/ |

8 |
Table of contents discipline |
The concept of graph. Examples of graphs. Different types of graphs. Properties of graphs. The simplest extremal problems on graphs. The concept of combinatorics. Combinatorial configurations. Binomial theorem. The concept of a Boolean function. The specification of Boolean functions by formulas. Perfect forms. The Post Theorem. |

9 |
Recommended literature |
O.I. Melnikov. Teaching discrete mathematics. M.: LCI, 2013. V.A. Emelichev, O.I. Melnikov, V.I. Sarvanov, R.I. Tyshkevich. Lectures on graph theory. M .: URSS, 2017. K.A. Rybnikov. Introduction to combinatorial analysis. Moscow: Nauka, 1985. V.P. Suprun Fundamentals of the theory of Boolean functions. M .: URSS, 2017. |

10 |
Methods of teaching |
Reproductive (passive), visual, comparative, dialog-heuristic, problematic, research. |

11 |
Language of instruction |
Russian. |

12 |
Conditions (requirements), current control |
Theoretical colloquiums, written tests. |

13 |
Form of current |
Attestation Exam. |