1 |
Title discipline |
Discrete mathematics. |

2 |
Training course |
1, specialty “Scientific and pedagogical activity”. |

3 |
Semester of training |
2 |

4 |
Number of credits |
3 |

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

6 |
Objectives of the study disciplines. |
Disciplines Introduction to the problems of discrete mathematics. Familiarity with graph theory. Acquaintance with combinatorics. Formation of the method of teaching elements of graph theory and elements of combinatorics in high school. 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 teaching elements of graph theory and combinatorics in school. |

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. Methods of teaching the theory of graphs in school. The concept of combinatorics. Combinatorial configurations. Binomial theorem. Methods of teaching combinatorics. |

9 |
Recommended literature |
O.I. Melnikov. The theory of graphs in entertaining problems. Moscow: LENAND, 2017. O.I. Melnikov. Dunno in the country of graphs. Moscow: LENAND, 2014. O.I. Melnikov. The theory of graphs for teachers. Moscow: LENAND, 2017. O.I. Melnikov. Teaching discrete mathematics. M.: LCI, 2013. S.A. Gutsanovich, O.I. Melnikov. Elements of discrete mathematics in entertaining examples and problems. Minsk: Research and Development, 2008. |

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

11 |
Language of instruction. |
Russian. |

12 |
Conditions current control |
Theoretical colloquiums, written tests. |

13 |
Form of current. |
Attestation Exam. |