| Date | Assignment | Reading | Subject | |
|---|---|---|---|---|
| Jan 24 | What's a "good" program? Efficiency, resources, problem vs. instance, O(*) | |||
| Jan 29 | chap. 1 | upper & lower bounds, best/worst/average cases | ||
| Jan 31 | big-O and friends | |||
| Feb 05 | chap. 2 | Extracting time bounds from pseudocode | ||
| Feb 06 | Last day to add classes | |||
| Feb 07 | chap. 2 | recursive algorithms & solving recurrence relations: forward & backward substitution |
||
| Feb 12 | recurrence relations, cont'd: change of variables |
|||
| Feb 14 | HW1 | The Master Method for solving recurrences | ||
| Feb 19 | chap. 3 | searching & selection | ||
| Feb 20 | Last day to drop classes | |||
| Feb 21 | chap. 4 | sorting | ||
| Feb 26 | HW1 due | chap. 5 | numeric algs | |
| Feb 28 | Handouts | optimization: greedy | ||
| Mar 04 | Handouts | network flow | ||
| Mar 06 | chap. 11.5 | optimization: dynamic programming | ||
| Mar 12 | Spring break | |||
| Mar 14 | ||||
| Mar 18 | HW2 | chap. 6 | finite automata & regular languages | |
| Mar 20 | pushdown automata & context-free languages | |||
| Mar 25 | Last day to withdraw from classes | |||
| Mar 25 | ||||
| Mar 27 | chap. 7 | string matching | ||
| Apr 01 | HW2 due | |||
| Apr 03 | chap. 8 | graph algorithms & representation | ||
| Apr 08 | Handouts | |||
| Apr 10 | Handouts | |||
| Apr 15 | chap. 9 | parallel algorithms | ||
| Apr 17 | ||||
| Apr 22 | HW3 | chap. 10 | computability | |
| Apr 24 | ||||
| Apr 29 | Handouts | complexity | ||
| May 01 | ||||
| May 06 | HW3 due | cryptography? quantum? catch up & review | ||
| May 15 | 344 final exam, 1:00-3:00 PM | |||