| Date | Assignment | Reading | Subject | |
|---|---|---|---|---|
| Jan 27 | chap. 1 | Intro; define problem, efficiency, resource, problem size | ||
| Jan 29 | algorithm vs. program; ignoring constant factors | |||
| Feb 03 | O(*), theta(*), o(*), Omega(*), omega(*), ... | |||
| Feb 05 | chap. 2 | comparing growth rates of functions | ||
| Feb 09 | Last day to add classes | |||
| Feb 10 | HW1 | chap. 2 | Problem-solving; pseudocode; analyzing pseudocode | |
| Feb 12 | ||||
| Feb 17 | ||||
| Feb 19 | ||||
| Feb 23 | Last day to drop classes | |||
| Feb 24 | Solving recurrence relations | |||
| Feb 26 | HW1 due | |||
| Mar 03 | class presentations of HW1 | |||
| Mar 05 | chap. 3 | graph problems and representation | ||
| Mar 10 | HW2 | |||
| Mar 12 | ||||
| Mar 14-22 | Spring break | |||
| Mar 24 | HW2 due | class presentations of HW2 | ||
| Mar 26 | ||||
| Mar 30 | Last day to withdraw from classes | |||
| Mar 31 | HW3 | Go over homework problems | ||
| Apr 02 | ||||
| Apr 07 | ||||
| Apr 09 | chap. 4 | greedy algorithms | ||
| Apr 14 | HW4 | |||
| Apr 16 | chap. 5 | divide and conquer | ||
| Apr 21 | ||||
| Apr 23 | No class; I'm out of town at a conference | |||
| Apr 28 | HW3 due | chap. 6 | dynamic programming | |
| Apr 30 | ||||
| May 05 | class presentations of HW3, HW4 | |||
| May 07 | HW4 due; no homework accepted after this date | class presentations of HW3, HW4; catch up and review for final exam |
||
| May 14 | 344 final exam, 3:30-5:30 PM | |||