Assessment:
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.
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)
Introductory lectures on: cryptography, graph drawing, machine
learning, AI, Monte Carlo method, machine learning
Introduction to Algorithms, Cormen, Leiserson, Rivest, Stein ONLINE ACCESS TO THE 2/e OF THE BOOK (from within McGill)
Instructor: David Avis
McConnell 308 avis@cs.mcgill.ca
http://cgm.cs.mcgill.ca/~avis
Office Hours:
please send email
Teaching Assistants:
Rami
Aladdin
rami.aladdin@mail.mcgill.ca
Yam
Chhetri
yam.chhetri@mail.mcgill.ca
Wanru
Lin
wanru.lin@mail.mcgill.ca
Raphael
Mannadiar raphael.mannadiar@mail.mcgill.ca
Bentley
Oakes
bentley.oakes@mail.mcgill.ca
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 www.mcgill.ca/integrity
for more
information).
Dec 13, 2011