Num | Day | Date | Topic | Materials (Textbook) |
---|---|---|---|---|
0 | Th | 26 Jan | ( | 1:Introduction; 4.3:Design Techniques; Readings 1 2 3 |
1 | Tu | 31 Jan | Genome Sequencing | 5:Genome Sequencing (not 5.6) |
2 | Th | 2 Feb | Genome II, Intro to Sequences | 5:Genome Sequencing, 6:Sequences, code |
3 | Tu | 7 Feb | Genome III, Span | 6:Sequences |
4 | Th | 9 Feb | Analysis Techniques, Reduce and scan | 4.4:Algorithm Analysis, 7:Contraction |
5 | Tu | 14 Feb | Maximum Contiguous Subsequence | 9.MCS |
6 | Th | 16 Feb | Probability Theory | 10.Probability |
7 | Tu | 21 Feb | Probability II | 10.Probability |
8 | Th | 23 Feb | Randomized Max2 | 11.Randomized Algorithms |
9 | Tu | 28 Feb | Quicksort Analysis | 11.Randomized Algorithms |
10 | Th | 2 Mar | Quicksort Analysis II | |
11 | Tu | 7 Mar | Treaps | 12, 13 |
12 | Th | 9 Mar | MIDTERM | |
13 | Tu | 28 Mar | Graphs | 14 |
14 | Th | 30 Mar | Breadth-First Search | 15 |
15 | Tu | 4 Apr | Depth-First Search | 15 |
16 | Th | 6 Apr | Shortest Path | 16 |
17 | Tu | 11 Apr | Shortest Paths II | 16 |
18 | Th | 13 Apr | Graph Contraction | 17 |
19 | Tu | 18 Apr | Graph Contraction | 17 |
20 | Th | 20 Apr | Minimum Spanning Trees | |
21 | Tu | 25 Apr | Dynamic Programming I | |
22 | Th | 27 Apr | HW Office Hours | |
23 | Tu | 2 May | Dynamic Programming II | |
24 | Th | 4 May | Dynamic Programming III | |
25 | Tu | 9 May | ) | |
Thursday | 18 May | FINAL EXAM Thursday 9am |
Note that the schedule is subject to change.