Algorithms und Datenstruktures - Conditional Course
Summer Term 2022
Fabian Kuhn
Lecture Videos and Slides
| Topic | Recording | Slides | ||
| Week 1 (25.04.-29.04.): | Sorting I |
|
|
|
| Week 2 (02.05.-06.05.): | Runtime analysis, Big-O Notation, Sorting II |
|
|
|
| Week 3 (09.05.-13.05.): | Abstract Data Types, Simple Data Structures, Binary Search |
|
|
|
| Week 4 (16.06.-20.05.): | Hashing I: Separate Chaining, Open Addressing |
|
|
|
| Week 5 (23.5.-27.5.): | Hashing II: Hash Functions, Universal Hashing, Rehash, Cuckoo Hashing |
|
|
|
| Week 6 (30.5.-04.6.): | Binary Search Trees I |
|
|
|
| Week 7 (6.6.-10.6.): | Binary Search Trees II |
|
|
|
| Week 8 (20.6.-24.6.): | Graph Algorithms I: BFS and DFS Traversal |
|
|
|
| Week 9 (27.6.-01.7.): | Graph Algorithms II: Minimum Spanning Trees |
|
|
|
| Week 10 (04.7.-08.7.): | Graph Algorithms III: Shortest Paths |
|
|
|
| Week 11 (11.7.-15.7.): | Dynamic Programming |
|
|
|
| Week 12 (18.7.-22.7.): | String Matching (Text Search) |
|
|
|