| Week |
Date |
Topic |
Code |
Reading |
Assignments |
| 1 |
8/31 |
Introduction to Algorithms |
-- |
IA 1.1 |
Assignment 1 due 9/14 |
| |
9/2 |
Selection sort and loop invariants |
code |
IA 2.1-2.2 |
-- |
| |
9/4 |
Selection sort complexity, asymptotic analysis |
-- |
IA 3.1 |
-- |
| 2 |
9/7 |
Labor Day |
-- |
-- |
-- |
| |
9/9 |
Asymptotic analysis |
-- |
IA 3.1 |
-- |
| |
9/11 |
Divide and Conquer: Mergesort |
code |
IA 2.3, 4.0 |
-- |
| 3 |
9/14 |
Divide and Conquer: Mergesort |
code |
IA 2.3, 4.0 |
Assignment 2 due 9/28 |
| |
9/16 |
Divide and Conquer: Maximum subarray |
code |
IA 4.1 |
-- |
| |
9/18 |
Divide and Conquer: Maximum subarray |
-- |
IA 4.1 |
-- |
| 4 |
9/21 |
Maximum subarray, Recurrence Relations |
-- |
IA 4.1 |
-- |
| |
9/23 |
Recurrence trees |
-- |
IA 4.4 |
-- |
| |
9/23 |
Substitution Method |
-- |
IA 4.4 |
-- |
| 5 |
9/28 |
Master method |
-- |
IA 4.5 |
-- |
| |
9/30 |
Heaps |
-- |
IA 6 |
Assignment 3 due 10/21 |
| |
10/2 |
2-3 trees |
-- |
pdf |
-- |
| 6 |
10/5 |
2-3 trees |
-- |
pdf |
-- |
| |
10/7 |
Red black trees |
code |
IA 13 |
-- |
| |
10/9 |
Red black trees |
-- |
IA 13 |
-- |
| 7 |
10/12 |
Midterm exam |
-- |
-- |
-- |
| |
10/14 |
No class |
-- |
-- |
-- |
| |
10/16 |
No class |
-- |
-- |
-- |
| 8 |
10/19 |
Fall Break |
-- |
-- |
-- |
| |
10/21 |
Red black trees |
-- |
IA 13 |
-- |
| |
10/23 |
Dynamic programming |
-- |
IA 15.0-15.1, 15.3 |
-- |
| 9 |
10/26 |
Dynamic programming |
-- |
IA 15.0-15.1, 15.3 |
-- |
| |
10/28 |
Dynamic programming |
-- |
IA 15.0-15.1, 15.3 |
Assignment 4 due 11/11 |
| |
10/30 |
Dynamic programming |
-- |
IA 15.4 |
-- |
| 10 |
11/2 |
Dynamic programming |
-- |
IA 15.4 |
-- |
| |
11/4 |
Greedy algorithms |
-- |
IA 16.1-16.3 |
-- |
| |
11/6 |
Greedy algorithms |
-- |
IA 16.1-16.3 |
-- |
| 11 |
11/9 |
Greedy algorithms |
-- |
IA 16.1-16.3 |
-- |
| |
11/11 |
Graph representations, BFS, DFS |
-- |
here |
-- |
| |
11/13 |
Dijkstras algorithm |
-- |
here |
-- |
| 12 |
11/16 |
Dijkstra's algorithm |
-- |
here |
-- |
| |
11/18 |
Bellman-Ford algorithm |
-- |
here |
Assignment 5 due 12/4 |
| |
11/20 |
Bellman-Ford algorithm |
-- |
here |
-- |
| 13 |
11/23 |
Floyd-Warshall algorithm |
-- |
here |
-- |
| |
11/25 |
Thanksgiving Break
| -- |
-- |
-- |
| |
11/27 |
Thanksgiving Break
| -- |
-- |
-- |
| 14 |
11/30 |
Prim's Algorithm |
-- |
here |
-- |
| |
12/2 |
NP-Completeness |
-- |
IA 34.0-34.5 |
-- |
| |
12/4 |
NP-Completeness |
-- |
IA 34.0-34.5 |
(Optional) Assignment 6 due 12/16 |
| 15 |
12/7 |
NP-Completeness |
-- |
IA 34.0-34.5 |
-- |
| |
12/9 |
NP-Completeness/Review |
-- |
IA 34.0-34.5 |
-- |
| |
12/11 |
Reading Period |
-- |
IA 34.0-34.5 |
-- |
