|
CS 483 Schedule |
||||
|
|
||||
|
Day |
Study Material |
Recommended Problems |
Topic |
|
|
Fundamentals |
||||
|
1 |
1.1, 1.2 |
Overview |
||
|
2 |
1.3, 1.4 |
Elementary Analysis |
||
|
3 |
2.1, 2.2 |
Asymptotics |
||
|
Analysis and Subproblems |
||||
|
4-6 |
2.3, 2.4, p.417-420 |
2.3: 1, 3, 4, 8 2.4: 1, 3, 4, 7, 8, 9 |
Recurrence Relations |
|
|
7 |
Chapter 3 |
3.1: 4, 6, 7; 3.2: 2, 5, 7, 8; 3.3: 2, 7; 3.4: 2, 4, 5; |
Try/Do Everything |
|
|
8-9 |
Chapter 4, |
4.1: 5, 8; 4.2: 5, 6, 10; 4.3: 1, 7; 4.5: 1, 2, 3, 6; |
Divide & Conquer |
|
|
10-11 |
5.3, 5.4, 5.6 |
5.3: 1, 2, 3, 5; 5.4: 1, 2, 5, 9; 5.6: 1, 2, 6, 7, 10; |
Decrease & Conquer |
|
|
Advanced Techniques |
||||
|
12-14 |
6.1, 6.4, 6.5, 6.6, 7.2 |
6.1: 1, 2, 3, 6, 7, 9, 10; 6.4: 1, 2, 3, 4, 8, 10; 6.5: 3, 6, 7, 8, 9; 6.6: 2, 4, 10; 7.2: 2; |
Transforming a Problem |
|
|
Spring Break (not part of the day count) |
||||
|
Day 15: Review; Prepare for Midterm |
||||
|
Day 16 (Mar. 24): Midterm Exam |
||||
|
17-19 |
Chapter 8 |
Study Sheet; 8.1: 7; 8.2: 1+, 8. 10; 8.3: 1, 2, 5, 6, 7; 8.4: 1, 4, 9; |
Dynamic Programming |
|
|
20-21 |
9.1, 9.3, 9.4 |
9.0: 1, 2; 9.1: 8, 10; 9.3: 2, 4, 6; 9.4: 1, 4; |
Greedy Algorithms |
|
|
Day 22 (April 14): Papers Due; Discussion of Topics |
||||
|
Hard Problems |
||||
|
23-25 |
10.1, 7.1,10.2, 10.3 |
10.1: 2, 4, 7, 9 10.2: 4, 6, 9 |
Limits to Algorithm Power |
|
|
26-27 |
11.1, 11.2, 11.3 |
11.1: 1, 2, 4, 7 11.2: 1, 2, 5 11.3: 1, 2 |
Coping |
|
|
Day 28 (Dec. 9) Finish Up and Review |
||||