|
|
||||||||
| 1 | Introduction, Stable Matching | Chp 1 | problems 1-2 (p. 22) other problems 4 (p.23), 8 (p. 27) |
Thurs Jan 17 Thurs Jan 17 Tues Jan 22 |
Thurs Jan 24 Thurs Jan 24 Thurs Jan 24 |
|||
| 2 | Complexity | Chp 2: | problems 1,3,4 (pp. 67-68) problems 5,6,8 (pp. 68-70) (see notes) |
Thurs Jan 24 Tues Jan 29 |
Thurs Jan 31 Thurs Jan 31 |
MLK Day - No lab Monday afternoon. | ||
| 3 | Graphs | Chp 3 | problems 2, 7 (pp. 107, 108) problems 4, 11 (pp. 107, 111) Programming Problem |
Tues Feb 12 (all) | ||||
| 4 | Graphs | Chp 3 | problems 2, 7 (pp. 107, 108) problems 4, 11 (pp. 107, 111) Programming Problem |
Tues Feb 5 Thurs Feb 7 Thurs Feb 7 |
Tues Feb 12 (all) | |||
| 5 |
|
Greedy Algorithms | Chp 4 | problems 3, 5, 6 (pp 189-191) Programming Problem |
Tues Feb 14 | Thur Feb 21 (written) See lab for prog prob. |
||
| 6 |
|
Greedy Algorithms | Chp 4 | Continue to work on programming problem.; | Tues Feb 19: GUI Thur Feb 22 Dijkstra brute force. |
|||
| 7 |
|
Divide and Conquer | Chp 5 | |||||
| 8 |
|
Review and Exam | Chaps 1-4 | Finish reading Chapter 5. Stay tuned for exercises. |
||||
| 9 |
|
Divide and Conquer | Chp 5 | Recurrence Exercises
problems 5,6 (p. 248, see comments in lec notes) |
Thurs Mar 13 & Tues Mar 18 | Thurs Mar 20 (problems only) | Wed-Fri: Prof Orr away at conference. | |
| 10 |
|
Dynamic Programming | Chp 6 | problems 3, 6, 8 (pp 314-320) Programming Problems |
Tues Apr 1 & Thur April 3 | Tues April 8 See lab for prog prob. |
||
| 11 |
|
|
||||||
| 11 |
|
Dynamic Programming | Chp 6 | Thur-Fri: Prof Orr away at conference | ||||
| 12 |
|
Network Flow | Chp 7 | |||||
| 13 |
|
NP, Game | Chp 8 | Programming Problem | See lab for due dates. | SSRD on Wed | ||
| 14 |
|
NP, Game (cont) | Chp 8 | |||||
| 15 |
|
Review for final. | Last day of class: Tue, April 29 | |||||
| 16 |
|
| ||||||