Date |
Class |
Description |
17/02 |
#01 |
Course Presentation ; Balanced Search Trees I (intro and concepts) |
18/02 |
#02 |
Balanced Search Trees II (AVL + red-black trees) |
24/02 |
#03 |
Self-Adjusting Data Structures I (self organizing lists, amortized analysis) |
25/02 |
#04 |
Self-Adjusting Data Structures II (splay trees) |
03/03 |
#05 |
Probabilistic Data Structures I (intro and treaps) |
04/03 |
#06 |
Probabilistic Data Structures II (skip lists + bloom filters) |
10/03 |
#07 |
Spatial Data Structures I (intro, quadtrees) |
11/03 |
#08 |
Spatial Data Structures II (kd-trees, range-trees, fr. cascading) |
17/02 |
#09 |
LCA and RMQ (buckets, sparse tables, cartesian trees) |
18/03 |
#10 |
(some more) 1D Problems (segment trees, lazy propagation, fenwick trees) |
24/03 |
#11 |
String Matching I (naive, KMP and rabin karp) |
25/03 |
#12 |
String Matching II (tries, suffix trees, suffix arrays) |