| |
| Lec. |
Month |
Day |
DW |
Topic |
Activity |
Lecturer |
| 1 |
Jan |
13 |
T |
Asymptotics, Recurrences |
|
TA |
| 2 |
Jan |
15 |
H |
Introduction |
Mini 1 out |
GM |
| 3 |
Jan |
20 |
T |
Probabilistic Analysis, Quicksort |
|
GM |
| 4 |
Jan |
22 |
H |
Selection |
Mini 1 due, HW1 and Mini 2 out |
GM |
| 5 |
Jan |
27 |
T |
Radix Structures |
|
DS |
| 6 |
Jan |
29 |
H |
Lower Bounds |
Mini 2 due |
DS |
| 7 |
Feb |
3 |
T |
Dynamic Programming |
|
GM |
| 8 |
Feb |
5 |
H |
Dynamic Programming |
HW 1 due, HW 2 and Mini 3 out |
GM |
| 9 |
Feb |
10 |
T |
Balanced Trees |
|
DS |
| 10 |
Feb |
12 |
H |
Amortized Analysis |
Mini 3 due |
DS |
| 11 |
Feb |
17 |
T |
Splay Trees |
|
DS |
| 12 |
Feb |
19 |
H |
Graph Algorithms I: MST |
HW 2 due, HW 3 and Mini 4 out |
GM |
| 13 |
Feb |
24 |
T |
Graph Algorithms II: DFS |
|
GM |
| 14 |
Feb |
26 |
H |
Midterm I |
Mini 4 due |
| 15 |
Mar |
2 |
T |
Graph Algorithms III: |
|
GM |
| 16 |
Mar |
4 |
H |
Graph Algorithms IV: |
HW 3 due, HW 4 out |
GM |
|
Mar |
9 |
T |
Spring Break |
|
Mar |
11 |
H |
Spring Break |
| 17 |
Mar |
16 |
T |
Network Flows I |
|
GM |
| 18 |
Mar |
18 |
H |
Network Flows II |
|
GM |
| 19 |
Mar |
23 |
T |
Computational Geometry 1 |
HW 4 due |
GM |
| 20 |
Mar |
25 |
H |
Computational Geometry II |
HW 5 out |
GM |
| 21 |
Mar |
30 |
T |
Advanced Data Structures |
|
DS |
| 22 |
Apr |
1 |
H |
Midterm II |
|
| 23 |
Apr |
6 |
T |
Competitive Algorithms I |
HW 5 due, HW 6 and Mini 6 out |
DS |
| 24 |
Apr |
8 |
H |
Competitive Algorithms II |
|
DS |
| 25 |
Apr |
13 |
T |
Linear Programming I |
|
DS |
|
Apr |
15 |
H |
Spring Carnival |
| 26 |
Apr |
20 |
T |
Linear Programming II |
HW 6 due, HW 7 out |
DS |
| 27 |
Apr |
22 |
H |
NP-Completeness I |
|
DS |
| 28 |
Apr |
27 |
T |
NP-Completeness II |
|
DS |
| 29 |
Apr |
29 |
H |
Approximation Algorithms |
HW 6 due |
DS |
| 30 |
May |
4 |
T |
Final |
5:30-8:30PM 7500 Wean |
tba |
|