| Watch until |
Topic |
Recording |
Slides |
|
| Week 1 (22.10.): |
Sorting I |
|
|
|
| Week 2 (29.10.): |
Runtime analysis, Big-O Notation, Sorting II |
|
|
|
| Week 3 (05.11.): |
Abstract Data Types, Simple Data Structures, Binary Search |
|
|
|
| Week 4 (12.11.): |
Hashing I: Separate Chaining, Open Addressing |
|
|
|
| Week 5 (19.11.): |
Hashing II: Hash Functions, Universal Hashing, Rehash, Cuckoo Hashing |
|
|
|
| Week 6 (26.11.): |
Binary Search Trees I |
|
|
|
| Week 7 (03.12.): |
Binary Search Trees II |
|
|
|
| Week 8 (10.12.): |
Graph Algorithms I: BFS and DFS Traversal |
|
|
|
| Week 9 (17.12.): |
Graph Algorithms II: Minimum Spanning Trees |
|
|
|
| Week 10 (07.01.): |
Graph Algorithms III: Shortest Paths |
|
|
|
| Week 11 (14.01.): |
Dynamic Programming |
|
|
|
| Week 12 (21.01.): |
String Matching (Text Search) |
|
|
|
