Computational complexity

Time complexity, space complexity, asymptotic complexity. Complexity classes P and NP.

Data structures

Introduction to basic data structures (linked list and array) and the construction of more complex structures using stack and queue, up to circular buffers, trees, sets, and associative arrays.

Recursion

Explanation of the principles of recursion and its types. Using recursion in the design of data structures and algorithms. A brief introduction to the Prolog language.

Sorting

Basic principles of sorting (stability, complexity, etc.), simple sorting methods (selection sort, insertion sort, bubble sort, etc.), as well as more advanced algorithms (heap sort, merge sort, quick sort).

Searching

Introduction to the principles of search data structures, search operations on lists and arrays (including binary and interpolation search), binary search trees, and hashing.

Representation of numbers in a computer

Bitwise operations, interpretation of binary numbers, floating-point representation, issues with this representation, and alternative representations.