Linear structures. Sequences. Lists. Stacks. Queues. Nonlinear structures. Trees: binary trees, minimizing the length of the road, touring the tree. Affected trees. Graphs. Modes of presentation, a tour of the graph width and depth, comprehensive tree and minimal comprehensive tree, determining the reachability and shortest distance, maximizing throughput, determining the topological order and critical path. Searching. Basic methods and improvements. Binary search tree, AVL tree, the optimal tree. M-ary tree search. B, B*, and B + trees, tree of digital search. Hashing. Hash functions, resolving collisions, external hashing. Sorting. Sort by comparison - method of insertion, selection, replacement, method of linear complexity. Sorting algorithms of time complexity O (N log N). The lower limit of the complexity of sorting.