| Monday | Tuesday | Wednesday |
| 9/3 Labor day holiday | 9/4 Lecture: Ch. 0, analyzing algorithms, asymptotic notation. Oh, Omega |
9/5 Lecture: Ch. 0, asymptotic notation. Little oh, limit theorem, code snippets. |
| 9/10 Lecture: Ch. 2 Divide and conquer and recurrences HW1 assigned |
9/11 Lab: HW1 | 9/12 Lecture: Ch. 2 Divide and conquer and recurrences |
| 9/17 Lecture: Ch. 2 Master theorem HW2 & P1 assigned |
9/18 Lab: HW2, P1 HW1 due |
9/19 Lecture: Randomized algorithms |
| 9/24 Lecture: Ch. 2 Randomized quicksort HW3 assigned |
9/25 Lab: HW3 HW2 due |
9/26 Yom Kippur holiday |
| 10/1 Lecture: Ch. 2 Lower bound for sorting, randomized selection HW4 assigned |
10/2 Lab: HW4, test review HW3 due |
10/3 Lecture: Ch. 3, 4 Graphs Adjacency lists, adjacency matrix, BFS |
| 10/8 Lecture: Ch. 3 Graphs DFS, edge classification, DAGs, topological sort |
10/9 Lab: Test review
HW4 due |
10/10 Test 1 Material 9/4-10/2 (inclusive) |
| 10/15 Lecture: Ch. 4 Dijkstra's algorithm HW5 assigned |
10/16 Lab: HW5 P1 due |
10/17 Lecture: Ch. 4 Heaps |
| 10/22 Lecture: Ch. 4 Bellman-Ford algorithm HW6 & P2 assigned |
10/23 Lab: HW6 HW5 due |
10/24 Lecture: Ch. 5 Minimum Spanning Trees Prim, Kruskal |
| 10/29 Lecture Ch. 5: Amortized Analysis Union-Find HW7 assigned |
10/30 Lab: HW7, test review HW6 due |
10/31 Lecture: Red-black trees |
| 11/5 Lecture: B-trees |
11/6 Lab: Test review HW7 due |
11/7 Test 2 Material 10/3-10/30 |
| 11/12 Lecture: Dynamic Programming HW8 assigned |
11/13 Lab: HW8 | 11/14 Lecture: Dynamic Programming |
| 11/19 Lecture: Greedy Algorithms HW9 assigned |
11/20 Lab: HW9 HW8 due |
11/21 Thanksgiving holiday |
| 11/26 Lecture: P& NP HW10 assigned |
11/27 Lab: HW10 | 11/28 Lecture: P& NP
HW9 due |
| 12/3 Lecture: Approximation algorithms HW10 assigned |
12/4 Lab: Review for Final P2 due |
12/5 Lecture& Lab: Review for Final
HW10 due |
The final exam is on Monday 12/17, 1pm-5pm.