Algorithms and Data Structures
Course code
MII6012
old course code
MII6012
Course title in Estonian
Algoritmid ja andmestruktuurid
Course title in English
Algorithms and Data Structures
ECTS credits
2.0
Assessment form
Examination
lecturer of 2023/2024 Spring semester
Not opened for teaching. Click the study programme link below to see the nominal division schedule.
lecturer of 2024/2025 Autumn semester
Not opened for teaching. Click the study programme link below to see the nominal division schedule.
Course aims
Core subject. The objective of the course is to introduce the fundamental concepts of data structures and the algorithms that proceed from them. The student attains the ability to analyse the complexity and effectiveness of algorithms and choose appropriate data structures and algorithms for problem solving.
Brief description of the course
Topics covered in lectures: Fundamental data structures: Stacks, queues, linked lists, hash tables, trees, graphs. Fundamental computing algorithms: O(N^2) and O(N log N) sorting algorithms hash tables, including collision-avoidance strategies binary search trees, representations of graphs depth- and breadth-first traversals. Basic algorithmic analysis: Asymptotic analysis of upper and average complexity, identifying bounds, differences between best, average, and worst case behaviours, big O notation. Algorithmic strategies.
Learning outcomes in the course
Upon completing the course the student:
Teacher
lekt. Inga Petuhhov
Prerequisite course 1