Algorithms and Datastructures - Conditional Course
Winter Term 2022/23
Fabian Kuhn
Lecture Videos and Slides
| Topic | Recording | Slides | ||
| Week 0 (17.10.-21.10) | Introduction |
|
||
| Week 1 (24.10.-28.10.): | Sorting I |
|
|
|
| Week 2 (31.10.-04.11.): | Runtime analysis, Big-O Notation, Sorting II |
|
|
|
| Week 3 (07.11.-11.11.): | Abstract Data Types, Simple Data Structures, Binary Search |
|
|
|
| Week 4 (14.11.-18.11.): | Hashing I: Separate Chaining, Open Addressing |
|
|
|
| Week 5 (21.11.-25.11.): | Hashing II: Hash Functions, Universal Hashing, Rehash, Cuckoo Hashing |
|
|
|
| Week 6 (28.11.-02.12.): | Binary Search Trees I |
|
|
|
| Week 7 (05.12.-09.12.): | Binary Search Trees II |
|
|
|
| Week 8 (12.12.-16.12.): | Graph Algorithms I: BFS and DFS Traversal |
|
|
|
| Week 9 (19.12.-23.12.): | Graph Algorithms II: Minimum Spanning Trees |
|
|
|
| Week 10 (09.01.-13.01.): | Graph Algorithms III: Shortest Paths |
|
|
|
| Week 11 (16.01.-20.01.): | Dynamic Programming |
|
|
|
| Week 12 (23.01.-27.01.): | String Matching (Text Search) |
|
|
|