Design and Analysis of Algorithms I (COMP 3804)
Sections A, B, C, and D
Winter 2022

Instructor: Michiel Smid
Office: Herzberg Building 5125C
E-mail: michiel(@scs.carleton.ca)
Lectures:
Winter term:
Office hours: Will start in the week of January 17. Click on a name to join a Zoom or Google Meet session with that person during their scheduled office hours.
Course objectives: An introduction to the design and analysis of algorithms.
Topics covered include: Divide-and-conquer algorithms and their analysis using recurrence relations, graph algorithms, dynamic programming, the theory of NP-completeness.
Textbook: Algorithms, by Sanjoy Dasgupta, Christos Papadimitriou, and Umesh Vazirani, published by McGraw-Hill.
Important dates:
Grading scheme:
Assignments:
Assignments from the winter term of 2021:
Midterm:
Final exam:
Academic Integrity (New, Please Read): As of 2020, there are new penalties in place for academic integrity violations. These will be issued by the Associate Dean (Undergraduate Affairs) of Science to students who copy, in whole or in part, work they submit for assignments. Note: While these are the standard penalties, more severe penalties may be applied when warranted. For more information, click here.
What was done in class:
Tentative schedule, based on the last time I taught this course.