Algorithms and Data Structures

Course code

IFI6012.DT

old course code

IFI6012

Course title in Estonian

Algoritmid ja andmestruktuurid

Course title in English

Algorithms and Data Structures

ECTS credits

3.0

Assessment form

Examination

lecturer of 2022/2023 Spring semester

Not opened for teaching. Click the study programme link below to see the nominal division schedule.

lecturer of 2023/2024 Autumn semester

Not opened for teaching. Click the study programme link below to see the nominal division schedule.

Course aims

Contribute to developing knowledge of linear and nonlinear data structures and their practical implementation skills. Support the development of problem analysis and solving based on the various data structures, using appropriate algorithms. Support the development of practical programming experience in simple language with pointers.

Brief description of the course

Lists. Linear data structures - stack, sequence, deque, properties, implementation. Tree. Binary tree: implementation, basic algorithms. Graph: implementation, basic algorithms depth- and breadth-first traversals, the shortest path, topological sort). 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. O (N ^ 2) and O (N * log N) sorting algorithms. Searching. Binary seach tree. Hashing.

Three homeworks must be done: solving a problem and presenting solution in a program.

Three homeworks must be done: solving a problem and presenting solution in a program.

Learning outcomes in the course

Upon completing the course the student:

After the course, the student:

Knows concepts about analysis and evaluation of algorithms and complexity. Describes dynamic and static data structures, and algorithms for them. Is able to analyze algorithms and evaluate their effectiveness. 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.

After the course, the student:

Knows concepts about analysis and evaluation of algorithms and complexity. Describes dynamic and static data structures, and algorithms for them. Is able to analyze algorithms and evaluate their effectiveness. 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.

Teacher

õp Inga Petuhhov

Prerequisite course 1

Study programmes containing that course