Week | Dates | Slides | Exercises | Chapters in the Book |
---|---|---|---|---|
1 | Aug. 26 & 28 | 1 - 66 | n/a | 2 Getting Started |
2 | Sept. 2 & 4 | 67 - 113 | Sept. 9 | 3 Growth of Functions, 4 Divide-and-Conquer |
3 | Sept. 9 & 11 | 114 - 178 | 4, 5 Probabilistic Analysis and Randomized Algorithms | |
4 | Sept. 18 | 179-185, 275-294 | 5, 9 Medians and Order Statistics | |
5 | Sept. 23 & 25 | 295-304, 323-366 | 9, 11 Hash Tables | |
6 | Sept. 30 & Oct. 2 | 367-374, 422-471 | 11, 14 Augmenting Data Structures, 15 Dynamic Programming | |
7 | Oct. 7 & 9 | 472 - 515 | 15.2 Matrix-chain multiplication, 15.4 Longest common subsequence | |
8 | Oct. 21 & 23 | 516 - 565 | 15.4 Optimal binary search trees, 16 Greedy Algorithms | |
9 | Oct. 28 & 30 | 566 - 621 | 17 Amortized Analysis | |
10 | Nov. 4 & 6 | 622 - 691 | 18 B-Tree, 19 Fibonacci Heaps | |
11 | Nov. 11 & 13 | 692 - 735 | 28 Matrix Operations | |
12 | Nov. 18 & 20 | 736 - 785 | 29 Linear Programming | |
13 | Nov. 25 & 27 | 786 - 836 | 35 Approximation Algorithms | |
14 | Dec. 2 & 4 | 837 - 860 | 31 Number-Theoretic Algorithms |
Dec. 3, 2014
http://www.cs.tut.fi/~elomaa/