|
Topic |
Recording |
Slides |
|
| Week 0 (17.04.-24.04) |
Introduction |
|
|
|
| Week 1 (28.04.-04.5.): |
Sorting I |
|
|
|
| Week 2 (05.05.-11.05.): |
Runtime analysis, Big-O Notation, Sorting II |
|
|
|
| Week 3 (12.05.-18.05.): |
Abstract Data Types, Simple Data Structures, Binary Search |
|
|
|
| Week 4 (19.05.-25.05.): |
Hashing I: Separate Chaining, Open Addressing |
|
|
|
| Week 5 (26.05.-01.06.): |
Hashing II: Hash Functions, Universal Hashing, Rehash, Cuckoo Hashing |
|
|
|
| Week 6 (02.06.-15.06.) [Extra week due to holidays]: |
Binary Search Trees I |
|
|
|
| Week 7 (16.06.-22.06.): |
Binary Search Trees II |
|
|
|
| Week 8 (23.06.-29.06.): |
Graph Algorithms I: BFS and DFS Traversal |
|
|
|
| Week 9 (30.06.-06.07.): |
Graph Algorithms II: Minimum Spanning Trees |
|
|
|
| Week 10 (07.07.-13.07.): |
Graph Algorithms III: Shortest Paths |
|
|
|
| Week 11 (14.07.-20.07.): |
Dynamic Programming |
|
|
|
| Week 12 (21.07.-27.07.): |
String Matching (Text Search) |
|
|
|
