1 
Title discipline 
Construction and analysis of algorithms. 
2 
Training course 
3, specialty “Scientific and Design Activity” 
3 
Semester of training 
5 
4 
Number of credits 
2 
5 
Name and surname lecturer 
Doctor of Pedagogical Sciences, Professor Melnikov Oleg Isidorovich. 
6 
Objectives of the study disciplines 
Introduction to tasks and methods of constructing, analyzing and evaluating algorithms. Formation of the skills of constructing algorithms and the ability to use them in the analysis of mathematical models of specific objects and processes. In the process of studying, the student should be able to: – formulate the main statements of the considered sections of the theory of algorithms; – аpply basic methods of constructing and evaluating algorithms for solving specific mathematical problems. 
7 
Prerequisites 
Initial information from graph theory, set theory, combinatorics. 
8 
Table of contents disciplines 
Principles of evaluating combinatorial algorithms. The simplest data structures. Search with return. The principle of “divide and conquer”. Construction of combinatorial configurations. The concept of the classes P and NP. 
9 
Recommended Literature 
Aho A., Hopcroft D., Ulman D. The design and Analysis of Computer Algorithms. AddisonWesley, 1974. Kormen T., Leizerson C., Rivest R. Introduction to Algorithms. Cambridg, London, 1990 Kotov V. M., Sobolevskaya E. P., Tolstikov A. A. Algorithms and data structures. Minsk: BSU, 2011

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 
Attestation Exam. 