Week #

Monday 
Wednesday 
Friday 
1 
January
3: Introduction. Ch. 1.

January
5: Complexity. Ch. 2.

January
7: Graph Algorithms. Ch. 3.

2

January
10: Graph Algs. (cont.)

January
12: Graph Algs. (cont.) HW #1 due.

January
14: Greedy Algorithms. Ch. 4 (4.44.6 are review; omit 4.7, 4.9).

3

January
17: Martin Luther King Day (no class) 
January
19: Greedy Algs. (cont.) HW #2 due.

January
21: Greedy Algs. (cont.)

4

January
24: Greedy Algs. (cont.)

January
26: Dynamic Programming. Ch. 6 (omit 6.86.10). HW #3 due.

January
28: Dynamic Prog. (cont.)

5

January
31: Dynamic Prog. (cont.)

February
2: Dynamic Prog. (cont.)

February
4: Dynamic Prog. (cont.)

6

February
7: Divide & Conquer. Ch. 5

February
9: Divide & Conquer (cont.)

February
11: Divide & Conquer (cont.) HW #4 due.

7

February
14: Divide & Conquer (cont.)

February
16: Divide & Conquer (cont.)

February
18: Review 
8

February
21: Presidents Day Holiday (no class) 
February
23: Midterm Exam 
February
25: NPCompleteness & Intractability. Ch. 8 (omit 8.9, 8.10).

9

February
28: NPCompleteness (cont.)

March
2: NPCompleteness (cont.) HW #5 due.

March
4: NPCompleteness (cont.)

10

March
7: NPCompleteness (cont.)

March
9: PSPACE. Ch. 9.

March
11: Final Review. HW #6 due.


March
15 (Tuesday):
FINAL EXAMINATION 2:30 PM  4:20
