Full text available on-line at: http://www.library.mcgill.ca/lists/books247.html
There will be one midterm exam (20%) and a final exam (60%) in the exam period. There will be 4 homework assignments (20%). The higher of the mark computed in this way and your final exam mark (taken as 100%) will be converted to a letter grade.
Late assignments -10% per day, including weekends.
Introduction (1 lecture)
Greedy Algorithms (2 lectures)
Network Flows (2 lectures)
Matchings (2 lectures)
Review (1 lecture), Midterm (1 lecture)
Integer Programming (1 lecture)NP-complete problems (4 lectures)
Case Study: Travelling Salesman Problem (1-3 lectures)
Introduction to Algorithms, Cormen, Leiserson, Rivest, Stein
Computer Algorithms, Baase and Van Gelder
Instructor: David Avis
McConnell 308 firstname.lastname@example.org http://www.cs.mcgill.ca/~avis
Office Hours: Tu, Th 10:00-11:00
Midterm: October 20 (tentative) in class.
Final exam: Thurs, Dec 8, 2-5pm,
Academic Integrity: Please read http://www.mcgill.ca/integrity/
August 26, 2005