There will be one midterm exam (20%) and a final exam (60%) in the exam period.
There will be 4 or 5 homework assignments (20%).
Late assignments -10% per day, including weekends.
Introduction (1 lecture)
Greedy Algorithms (3 lectures)
Dynamic Programming (3 lectures)
Network Flows (3 lectures)
Matchings (2 lectures)
Review (1 lecture), Midterm (1 lecture)
Linear and Integer Programming (2 lectures)NP-complete problems (4 lectures)
Wrap up and 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://cgm.cs.mcgill.ca/~avis
Office Hours: M 10:30-11 W 1-1:30 or by appointment.
No office hours April 14-18
Teaching Assistant: Anil
Ada aada at
For office hours and other information: http://www.cs.mcgill.ca/~aada/360.html
Academic Integrity: Please read http://www.mcgill.ca/integrity/
January 8, 2008