Assessment:
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.
Assignments are to be left in the box near the labs,
McConnell 1st floor.
Late assignments -10% per day, including
weekends.
Introduction (1 lecture)
Greedy Algorithms (2 lectures)
Minimum Spanning Trees (2 lectures)
Dynamic Programming (2 lectures)
Shortest Paths in Graphs (2 lectures)
Network Flows (2 lectures)
Review (1 lecture), Midterm (1 lecture)
Matchings (2 lectures)
Linear Programming (2 lectures)
NP-complete problems (4 lectures)
Linear Programming (2 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 avis@cs.mcgill.ca
http://www.cs.mcgill.ca/~avis
Office Hours: Tu, Th
2:00-3:30
Teaching Assistants:
Maxime Desco <mdesco@cim.mcgill.ca>
Midterm: March 4, in class
Final exam: tba
Academic Integrity: Please read http://www.mcgill.ca/integrity/
Last update:January 23, 2003