| Course title | Algorithms and Data Structures |
|---|---|
| Course code | KI/EDSA |
| Organizational form of instruction | Lecture + Lesson |
| Level of course | unspecified |
| Year of study | not specified |
| Semester | Summer |
| Number of ECTS credits | 7 |
| Language of instruction | English |
| Status of course | unspecified |
| Form of instruction | Face-to-face |
| Work placements | This is not an internship |
| Recommended optional programme components | None |
| Course availability | The course is available to visiting students |
| Lecturer(s) |
|---|
|
| Course content |
|
1. Terminology, time complexity, memory complexity 2. Basic data structures - array, list, stack, queue 3. Sorting algorithms O(n^2) - SelectSort, InsertSort, BubbleSort 4. Sorting algorithms O(n^k) - ShellSort, KnuthSort, HeapSort 5. Sorting algorithms O(n.log_k n) - QuickSort, MergeSort 6. Sorting algorithms O(k.n) - RadixSort, BucketSort 7. Searching algorithms - Brute Force, Binary Search, Interpolation Search 8. Indexing - Dense Index, Sparse Index, Multilevel Index 9. Hashing - Close Hash Table, Open Hash Table, Perfect Hash, Rehash 10. Tree structures - properties, Binary Tree, Binary Search Tree 11. Tree structures - Digi Tree, B-Tree 12. Balanced tree structures - AVL-tree, Red-Black tree 13. Special tree structures - Trie, Splay, Treap, Randomized BST 14. Algorithms of computational geometry
|
| Learning activities and teaching methods |
| unspecified |
| Learning outcomes |
| Prerequisites |
|
unspecified
|
| Assessment methods and criteria |
|
unspecified
Basics of procedural programming (conditional statements, loops, procedures) |
| Recommended literature |
|
|
| Study plans that include the course |
| Faculty | Study plan (Version) | Category of Branch/Specialization | Recommended semester |
|---|