| Watch until |
Topic |
Recording |
Slides |
|
| Week 1 (27.04.): |
Sorting I |
|
|
|
| Week 2 (04.05.): |
Runtime analysis, Big-O Notation, Sorting II |
|
|
|
| Week 3 (11.05.): |
Abstract Data Types, Simple Data Structures, Binary Search |
|
|
|
| Week 4 (18.05.): |
Hashing I: Separate Chaining, Open Addressing |
|
|
|
| Week 5 (01.06.): |
Hashing II: Hash Functions, Universal Hashing, Rehash, Cuckoo Hashing |
|
|
|
| Week 6 (08.06.): |
Binary Search Trees I |
|
|
|
| Week 7 (15.06.): |
Binary Search Trees II |
|
|
|
| Week 8 (22.06.): |
Graph Algorithms I: BFS and DFS Traversal |
|
|
|
| Week 9 (29.06.): |
Graph Algorithms II: Minimum Spanning Trees |
|
|
|
| Week 10 (06.07.): |
Graph Algorithms III: Shortest Paths |
|
|
|
| Week 11 (13.07.): |
Dynamic Programming |
|
|
|
| Week 12 (20.07.): |
String Matching (Text Search) |
|
|
|
