LECTURE SCHEDULE (TENTATIVE)
Probability |
Randomized Searching |
Randomized Quick Sort |
Verifying Matrix Multiplication |
Primality Testing |
Randomized Min-Cut |
Amortized Analysis |
Disjoint Sets |
Universal Hashing |
Skip List |
2-3 Trees |
MIDTERM EXAM |
Treaps |
Splay Trees |
String Matching |
Z Algorithm |
Knuth-Morris-Pratt Algorithm |
Boyer-Moore Algorithm |
Suffix Trees |
Suffix Arrays |
FINAL EXAM |