Week | Dates | Slides | Exercises | Chapters in the Book |
---|---|---|---|---|
1 | Aug. 25 & 27 | 1 - 71 | n/a | 2 Getting Started |
2 | Sept. 1 & 3 | 72 - 127 | Sept. 7 | 3 Growth of Functions, 4 Divide-and-Conquer |
3 | Sept. 8 & 10 | 128 - 180 | Sept. 14 | 4, 5 Probabilistic Analysis and Randomized Algorithms |
4 | Sept. 15 & 17 | 181 - 239 | Sept. 21 | 5, 9 Medians and Order Statistics, 11 Hash Tables |
5 | Sept. 22 & 24 | 240 - 296 | Sept. 28 | 11.3 Hash Functions, 14 Augmenting Data Structures |
6 | Sept. 29 & Oct. 1 | 297 - 352 | Oct. 5 | 14, 15 Dynamic Programming |
7 | Oct. 6 & 8 | 353 - 392 | Oct. 19 | 15.4 Longest common subsequence, 15.5 Optimal binary search trees |
8 | Oct. 20 & 22 | 393 - 422 | Oct. 26 | Guest Lecture by Timo Aho, 16 Greedy Algorithms |
9 | Oct. 27 & 29 | 423 - 478 | Nov. 2 | 17 Amortized Analysis |
10 | Nov. 3 & 5 | 479 - 542 | Nov. 9 | 18 B-Trees, 19 Fibonacci Heaps |
11 | Nov. 10 & 12 | 543 - 580 | Nov. 16 | 23 Minimum Spanning Trees |
12 | Nov. 17 & 19 | 581 - 633 | Nov. 23 | 24 Single-Source Shortest Paths, 31 Number-Theoretic Algorithms |
13 | Nov. 24 & 26 | 634 - 678 | Nov. 30 | 31, 35 Approximation Algorithms |
14 | Dec. 1 | 679 - 690 | 35 |
Dec. 1, 2015
http://www.cs.tut.fi/~elomaa/