Student
Algorithms and data structures
Price 0€
Amount 5.00 ECTS
Suur-Sõjamäe 10a, Tallinn
Data types. The concept of algorithm complexity. Complexity classes, big O notation, complexity analysis. Analysis of algorithms. Recursive algorithms. Data structures: lists, binary trees, heaps, stacks; examples of their usage. Search and sorting algorithms, evaluation of operations count. Typical tasks related to graphs and algorithms. NP-complete problems. Generalized programming and generalized algorithms.
Lectures take place
September 10, 2025, 16:00 (3 acad. hours)
September 16, 2025, 16:00 (3 acad. hours)
September 23, 2025, 17:30 (3 acad. hours)
October 01, 2025, 16:00 (3 acad. hours)
October 06, 2025, 16:00 (3 acad. hours)
October 07, 2025, 17:30 (3 acad. hours)
October 13, 2025, 17:30 (3 acad. hours)
October 14, 2025, 17:30 (3 acad. hours)
November 03, 2025, 16:00 (3 acad. hours)
November 04, 2025, 17:30 (3 acad. hours)
November 10, 2025, 16:00 (3 acad. hours)
November 17, 2025, 16:00 (3 acad. hours)
A person who has passed the course
Knows concepts related to analysis, evaluation and complexity of algorithms
Describes linear and non-linear data structures and algorithms applied thereto
Can analyse algorithms and evaluate their efficiency
Can choose an appropriate data structure and algorithm for simple and typical problems depending on specific issue to be solved
Solves tasks by using learned algorithms and with help of programming language supporting imperative usage of references
Lecturer
Anna Grund MSc
Requirements for passing the course: Course works/Tests
