| Watch until |
Topic |
Recording |
Slides |
|
| 18.10 |
Introduction |
|
|
|
| 25.10 |
Sorting I |
|
|
|
| 08.11 |
Runtime analysis, Big-O Notation, Sorting II |
|
|
|
| 15.11 |
Abstract Data Types, Simple Data Structures, Binary Search |
|
|
|
| 22.11 |
Hashing I: Separate Chaining, Open Addressing |
|
|
|
| 29.11 |
Hashing II: Hash Functions, Universal Hashing, Rehash, Cuckoo Hashing |
|
|
|
| 06.12 |
Binary Search Trees I |
|
|
|
| 13.12 |
Binary Search Trees II |
|
|
|
| 20.12 |
Graph Algorithms I: BFS and DFS Traversal |
|
|
|
| 10.01 |
Graph Algorithms II: Minimum Spanning Trees |
|
|
|
| 24.01 |
Graph Algorithms III: Shortest Paths |
|
|
|
| 31.01 |
Dynamic Programming |
|
|
|
| 07.02 |
String Matching (Text Search) |
|
|
|
