Algorithm Design Techniques

 COMP 360              Fall 2013   Trottier 1100   TuTh 8:35 - 9:50

return to:  course home page      also check:  announcements

Required Text: Algorithm Design, J. Kleinberg and E. Tardos, Pearson 2006.

Additional material for this text available from myCourses

Prerequisite:  308-251
 Students without the prerequisites will be deleted from the course list.

Advanced algorithmic techniques and applications. Topics include Network Flows, Linear programming,
Complexity and NP-completeness, Local Search Heuristics, Approximation Algorithms, and Randomized Algorithms.

There will be one midterm exam (25%)  and a final exam (75%) in the exam period.  
(Note these ratios were changed 2013.9.12 to conform with exam office rules)

Exercises will be given and graded, but will not count towards the final mark.

Texts on Reserve at PSEL(Schulich) Library:

Algorithm Design, Kleinberg and Tardos

Introduction to Algorithms, Cormen, Leiserson, Rivest, Stein

Computer Algorithms, Baase and Van Gelder

Jeff Erickson also has some excellent lecture notes on algorithms here.

Instructor:  David Avis
McConnell 308            
Office Hours: Tu, Thurs 1:30pm - 2:30pm  

Teaching Assistants:

Liana Yepremyan           liana.yepremyan at
McConnell 303
Office Hours: W 10:30-11:30      (Oct 23 is held in McConnell 320)

Mandatory statements:

In accord with McGill University’s Charter of Students’ Rights, students in this course have the right to submit in English or in French any written work that is to be graded.

McGill University values academic integrity.  Therefore all students must understand the meaning and consequences of cheating, plagiarism and other academic offences under the Code of Student Conduct and Disciplinary Procedures (see for more information).


August 28, 2013