The textbook is:
The last day to withdraw without failure is Monday, February 23, 2004. The final exam for the course will take place on Tuesday, May 4, 2004, at 9am in the classroom (SWGR 2A19). This is the regularly scheduled time for courses taught from 0930 to 1045 on Tuesdays and Thursdays. ( See the university exam schedule.)
Please see elsewhere in the web pages for the course for additional administrative information.
| Week | Lecture Topics | Readings | Homework |
|---|---|---|---|
| 1: January 13, 15 | Introduction | Syllabus, Ch.1 [L] | TBD |
| 2: January 20, 22 | Algorithm Correctness | Notes | TBD |
| 3: January 27, 29 | Algorithm Efficiency | Ch.2 [L] | TBD |
| 4: February 3, 5 | Algorithm Efficiency (Ctd.) | Ch.2 [L] | TBD |
| 5: February 10, 12 | Brute Force | Ch.3 [L] | TBD |
| 6: February 17, 19 | Review for Midterm and Midterm | TBD | |
| 7: February 24, 26 | Divide and Conquer | Ch.4 [L] | TBD |
| 8: March 2, 4 | Divide and Conquer (Ctd.) | Ch.4 [L] | TBD |
| 9: March 9, 11 | Spring Break | TBD | |
| 10: March 16, 18 | Decrease and Conquer | Ch.5 [L] | TBD |
| 11: March 23, 25 | Transform and Conquer | Ch.6 [L] | TBD |
| 12: March 30, April 1 | Dynamic Programming | Ch.8 [L] | TBD |
| 13: April 6, 8 | Greedy Technique | Ch.9 [L] | TBD |
| 14: April 13, 15 | Greedy Technique (Ctd.) | Ch.9 [L] | TBD |
| 15: April 20, 22 | Limitations, Backtracking, and Branch and Bound | Chs. 10 and 11 [L] | TBD |
| 16: April 27 | Review | TBD | TBD |