Instructor: Prof. Claude Crépeau
Office Hours: Tuesdays 10:30-13:30 McConnell Eng. Bldg. room 110N
avoid sending me HomeWork questions directly; use link below for faster replies...
FOR ALL CLASS MATTERS CONTACT firstname.lastname@example.org
This way the Lecturer and all the T.A.s will get your e-mail.
or via the FACEBOOK group COMP251 Fall 2016
L E C T U R E S
Lecture 2. (7 Sept 2016)
Lecture 3. (12 Sept 2016)
Lecture 5-6. (19-21 Sept 2016)
Lecture 8. (28 Sept 2016)
Homework 2 IN;
Lecture 12. (October 17th, 2016)
Homework 3 OUT
; to be submitted via MyCourse by 16 Nov
Lecture 18. (November 7th, 2016)
Lectures 21-22. (November 16th-21st, 2016)
Homework 3 IN; to be submitted via MyCourse by 16 Nov
Lectures 23-24-25.(November 23rd-28th-30th, 2016)
Homework 4 IN; to be submitted via MyCourse by 5 Dec
BELOW THIS LINE : UPDATE REQUIRED 2016
Design and analysis of algorithms. Complexity of algorithms. Data structures. Introduction to graph algorithms and their analysis.
(3 credits; 3 hours)
Prerequisites: either COMP 250 or COMP 203.
Schedule Types: Lecture, Final Exam, Midterm Exam, Optional Tutorial.
Restriction: Not open to students who have taken or are taking COMP 252.
Restrictions: May not be enrolled in one of the following Levels:
Masters & Grad Dips & Certs
May not be enrolled in one of the following Faculties:
Faculty of Medicine
Centre for Continuing Education
Faculty of Dentistry
Send comments/questions to email@example.com