COMP251      Algorithms and Data Structures       Winter 2012

Trottier 0100        Mon-Wed 1:05pm - 2:25pm

return to:  course home page      also check:  announcements

Required Text:    Algorithm Design      J.Kleinberg and E. Tardos  Addison-Wesley, 2006.

  CHAPTER 1            CHAPTER 6                 CHAPTER 13   

Prerequisite:  either COMP 250 or COMP 203.
 Students without the prerequisites will be deleted from the course list.

There will be one midterm exam (20%)  and a final exam (80%) in the exam period.
Exercises will be given and graded, but will not count towards the final mark.

Topics:   Subject to revision.

1. Algorithm Design, Chs. 1-7

Introduction and representative problems (2 lectures)

Review of algorithm analysis (2 lectures)

Graphs and basic graph algorithms (2 lectures)

Greedy Algorithms (3 lectures)

Divide and Conquer (2 lectures)

Dynamic Programming (3 lectures)

Network Flows and applications (5 lectures)

2. Additional topics (as time allows)

Introductory lectures on:  cryptography, graph drawing, machine learning, AI, Monte Carlo method, machine learning

Texts on Reserve at PSEL(Schulich) Library:

Algorithm Design, Kleinberg and Tardos      

Introduction to Algorithms, Cormen, Leiserson, Rivest, Stein    ONLINE ACCESS TO THE 2/e OF THE BOOK (from within McGill)

Instructor:  David Avis
McConnell 308            
Office Hours:  please send email

Teaching Assistants:

Rami Aladdin         
Yam Chhetri           
Wanru Lin             
Raphael Mannadiar
Bentley Oakes       

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).


Dec 13, 2011