Mathematical bases of analysis of computational complexity of algorithms, typical data structures for representation of sets: arrays and dynamic list structures, stacks, queues and trees are considered. Methods for solving combinatorial problems and the main methods for reducing brute force, search, sorting problems and algorithms on graphs are given. For students of the Faculty of Informatics and Computer Engineering in the direction of training bachelors "Informatics and Computer Engineering," as well as other areas and profiles related to software development.