Algorithms
Fall 2000
Tentative Schedule
|
Day
|
Topic
|
Readings
|
| We 9/6 |
What is an algorithm |
|
| Fr 9/8 |
Analyzing algorithms |
Chap. 1 (esp. 1.4) |
| Mo 9/11 |
Big Oh |
Chap. 1.5-6 |
| We 9/13 |
Big Oh |
|
hw1 due |
| Fr 9/15 |
Big Oh |
|
| Mo 9/18 |
Analyzing recursive code |
Chap. 3.6-7 |
| We 9/20 |
Analyzing recursive code |
|
| Fr 9/22 |
Trees |
Chap. 2.3 |
hw2 due |
| Mo 9/25 |
Trees |
|
| We 9/27 |
Trees |
|
| Fr 9/29 |
Trees |
|
| Mo 10/2 |
Trees |
|
| We 10/4 |
Induction |
Chap. 3.1-4 |
hw3 due |
| Fr 10/6 |
Algorithm Design |
|
| Mo 10/9 |
Divide and Conquer |
Chap. 4.3-5 |
hw4 due |
| We 10/11 |
Divide and Conquer |
|
| Mo 10/16 |
Divide and Conquer |
|
hw5 due |
| We 10/18 |
review |
|
| Fr 10/20 |
midterm1 |
|
| Mo 10/23 |
Strengthening I.H. |
|
| We 10/25 |
celebrity |
|
| Fr 10/27 |
solution to midterm1 |
|
| Mo 10/30 |
wrap-up |
|
hw6 due |
| We 11/1 |
Dynamic Programming |
Chap. 10 |
| Fr 11/3 |
Dynamic Programming |
|
| Mo 11/6 |
Graphs |
Chap. 7 |
hw7 due |
| We 11/8 |
Graphs |
|
| Fr 11/10 |
Graphs |
Chap. 8 |
| Mo 11/13 |
Graphs |
|
hw8 due |
| We 11/15 |
review |
|
| Fr 11/17 |
midterm2 |
|
| Mo 11/20 |
Hashing |
Chap. 6.5 |
| We 11/22 |
Greedy |
|
| Mo 11/27 |
no class |
|
| We 11/29 |
guest lecture |
|
| Fr 12/1 |
no class |
|
| Mo 12/4 |
Greedy |
|
hw9 due |
| We 12/6 |
Loop invariants |
Chap. 3.5 |
| Fr 12/8 |
Loop invariants |
|
| Mo 12/11 |
project presentations |
|
| We 12/13 |
review |
|
| Tu 12/19 |
final (8:30) |
|