The textbook is:
The first day of classes is Tuesday, January 11, 2005. The last day to withdraw without failure is Monday, February 21, 2005. The last day of classes is Thursday, April 21, 2005. The final exam for the course will take place on Friday, April 29, 2005, at 2pm in the classroom (SWGR 2A31). This is the regularly scheduled time for courses taught from 1400 to 1515 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 11, 13 | Introduction | Syllabus, Ch.1 [L] | TBD |
| 2: January 18, 20 | Algorithm Correctness | Notes | TBD |
| 3: January 25, 27 | Algorithm Efficiency | Ch.2 [L] | TBD |
| 4: February 1, 3 | Algorithm Efficiency (Ctd.) | Ch.2 [L] | TBD |
| 5: February 8, 10 | Brute Force | Ch.3 [L] | TBD |
| 6: February 15, 17 | Review for Midterm and Midterm | TBD | |
| 7: February 22, 24 | Divide and Conquer | Ch.4 [L] | TBD |
| 8: March 1, 3 | Divide and Conquer (Ctd.) | Ch.4 [L] | TBD |
| 9: March 8, 10 | Spring Break | TBD | |
| 10: March 15, 16 | Decrease and Conquer | Ch.5 [L] | TBD |
| 11: March 22, 24 | Transform and Conquer | Ch.6 [L] | TBD |
| 12: March 29, March 31 | Dynamic Programming | Ch.8 [L] | TBD |
| 13: April 5, 7 | Greedy Technique | Ch.9 [L] | TBD |
| 14: April 12, 14 | Greedy Technique (Ctd.) | Ch.9 [L] | TBD |
| 15: April 19, 21 | Limitations, Backtracking, and Branch and Bound | Chs. 10 and 11 [L] | TBD |