| Watch until |
Topic |
Recording |
Slides |
|
| 23.10 |
Introduction |
|
|
|
| 30.10 |
Sorting I |
|
|
|
| 06.11 |
Runtime analysis, Big-O Notation, Sorting II |
|
|
|
| 13.11 |
Abstract Data Types, Simple Data Structures, Binary Search |
|
|
|
| 20.11 |
Hashing I: Separate Chaining, Open Addressing |
|
|
|
| 27.11 |
Hashing II: Hash Functions, Universal Hashing, Rehash, Cuckoo Hashing |
|
|
|
| 04.12 |
Binary Search Trees I |
|
|
|
| 11.12 |
Binary Search Trees II |
|
|
|
| 18.12 |
Graph Algorithms I: BFS and DFS Traversal |
|
|
|
| 08.01 |
Graph Algorithms II: Minimum Spanning Trees |
|
|
|
| 15.01 |
Graph Algorithms III: Shortest Paths |
|
|
|
| 22.01 |
Dynamic Programming |
|
|
|
| 29.01 |
String Matching (Text Search) |
|
|
|
