Linear Tables, Chain Tables, Stacks, Queues

Sorting:

Quick Sort, Heap Sort, Normalize, Hill Sort, Insertion Sort, Selection Sort

Binary Trees:

Precedent, Intermediate, Posterior traversal, Hierarchical traversal, both recursive and non-recursive algorithms

AVL Trees. Huffman coding

Transformation between binary trees and trees, forests, threading trees

Graph Algorithms:

Depth-first traversal algorithms, breadth-first traversal algorithms, minimum spanning trees, shortest paths

String:

Finding substrings, KMP algorithms, and more.

Beginners must understand these basic algorithms. Also, practice the algorithms in the book, the code is knocked out. For the exam, it is enough to look at the teacher's key points.