AIMS AND OBJECTIVES OF THE COURSE: Acquisition of skills for problem algorithmization, analysis and evaluation of algorithms and synthesis of programs based on such algorithms. Students are introduced to basic groups of algorithms: number processing, sorting, search, hashing, tree structures, recursion, list structures, graph and graph processing. Classical algorithmic solutions are reproduced and analyzed. Evaluation of different problem.
DESCRIPTION OF THE COURSE: The course introduces students to the theory of algorithmization, analysis of the complexity and resource intensity of algorithms and synthesis of optimal algorithms. Classical groups of algorithms are considered: number processing, sorting, search, hashing, tree structures, recursion, list structures, graph and graph processing. Classical algorithmic solutions are reproduced and analyzed.
