| Tuesday | Thursday |
| 8/25 Lecture: Ch. 0, analyzing algorithms, asymptotic notation. Oh, Omega 8/25 Lab |
8/27 Lecture: Ch. 0, asymptotic notation. Little oh, limit theorem, code snippets. |
| 9/2 No class 9/2 Lab: HW1 HW1 assigned |
9/4: Lecture: Heaps |
| 9/9 Lecture: Red-black trees 9/9 Lab: HW2 HW2 assigned |
9/11 Lecture: B-trees HW 1 due |
| 9/16 Lecture: Ch. 2 Divide and conquer and recurrences 9/16 Lab: HW3 HW3 assigned |
9/18 Lecture: Ch. 2 Divide and conquer and recurrences HW 2 due Project 1 assigned |
| 9/23 Lecture: Ch. 2 Divide and conquer and recurrences 9/23 Lab: HW4 HW4 assigned |
9/25 Lecture: Ch. 2 Master theorem HW3 due |
| 9/30 Lecture: Dynamic Programming 9/30 Lab: HW5 HW5 assigned |
10/2 Lecture: Dynamic Programming and Greedy Algorithms HW4 due |
| 10/7 Lecture: Dynamic Programming and Greedy Algorithms 10/7 Lab: Project 1 |
10/9 Fall break |
| 10/14 Lecture: Ch. 3, 4 Graphs Adjacency lists, adjacency matrix, BFS 10/14 Lab: Test review HW 5 due |
10/16 Lecture: Test review |
| 10/21 Test Material 8/25-10/2 (inclusive) 10/21 Lab: Project 1 |
10/23 Lecture: Ch. 3 Graphs DFS, edge classification, DAGs, topological sort |
| 10/28 No class 10/28 Lab: HW6 HW6 assigned |
10/30 Lecture: Ch. 4 Dijkstra's algorithm Project 1 due; project 2 assigned |
| 11/4 Lecture: Ch. 4 Bellman-Ford algorithm 11/4 Lab: HW7 HW7 assigned |
11/6 Lecture Ch. 5: Minimum Spanning Trees Prim, Kruskal HW6 due |
11/11 Lecture Ch. 5: Amortized Analysis; Ch. 2: Sorting, Lower Bound for Sorting 11/11 Lab: HW8 HW 8 assigned |
11/13 Lecture: Ch. 2 Randomized algorithms HW7 due |
| 11/18 Lecture: Ch. 2 Randomized algorithms, quicksort, selection 11/18 Lab: HW9 HW9 assigned |
11/20 Lecture: Probabilistic Road Maps HW8 due |
| 11/25 Lecture: P & NP 11/25 Lab: Project 2 Extra credit HW assigned |
11/27 Thanksgiving holiday |
| 12/2 Lecture: P & NP 12/2 Lab: Review for the Final HW9 due |
12/4 Lecture: P & NP Project 2 due; extra credit homework due |
The final exam is on Friday 12/12, 8am-noon.