Algorithms and Data Structures
Course code
old course code
Course title in Estonian
Algoritmid ja andmestruktuurid
Course title in English
Algorithms and Data Structures
ECTS credits
Assessment form
lecturer of 2023/2024 Spring semester
Inga Petuhhov (language of instruction:Estonian)
lecturer of 2024/2025 Autumn semester
Not opened for teaching. Click the study programme link below to see the nominal division schedule.
Course aims
Support learning about linear and non-linear data structures and their practical application. Support development of problem analysis and solution skills using data structures and suitable algorithms. Support development of practical programming skills in the simple imperative C language that allows the use of references
Brief description of the course
Static and dynamic memory management. Linear data structures, linked lists. Stack, queue, deque, properties, implementation. Tree. Binary tree: implementation, basic algorithms. Graph: implementation, basic algorithms. Basic algorithmic analysis. Complexity classes and Big O notation. Algorithmization strategies. O (N ^ 2) and O (N * log N) sorting algorithms. Searching. Binary seach tree (AVL-tree, red-black-tree, b-tree). Hashing.
Learning outcomes in the course
Upon completing the course the student:
- describes linear and nonlinear dynamic and static data structures, and algorithms for them;
- can in case of more typical problems choose appropriate data structures and algorithms, depending on the problem to be solved;
- creates a computer program, witch uses learnd algorithms to solve the problems.
Inga Petuhhov