SUBJECT

Title

Algorithms and data structures I.

Type of instruction

lecture + practical

Level

bachelor

Faculty

Faculty of Informatics

Part of degree program

Credits

2+2

Recommended in

Semester 3

Typically offered in

Autumn semester

Course description

I. Fundamentals

1. Running time of algorithms;

2. Abstraction levels of data types

II. Basic data structures

3. Arrays;

4. Stacks;

5. Queues;

6. Priority queues;

7. Lists;

8. Trees

III. Search trees

9. Binary search trees;

10. AVL-trees;

11. 2-3-trees and B-trees

IV. Sorting

12. Bubble sort, insertion sort and sorting with maximum search;

13. Tournament sort;

14. Heapsort;

15. Quicksort;

16. Merge sort;

17. Lower bound for running

Readings