CSC 373, Spring 2018
Algorithm Design, Analysis and Complexity

General Information

Instructor Prof. Allan Jepson.
Email jepson at cs dot utoronto dot ca
Office Hours Wed. 4:20-5pm in D.L. Pratt 283D (Note start at approx 4:20, since I am coming from class in Lash Miller)
Or by appointment.
Lectures L0101 and L2003: Mon., Wed. and Fri., 11am-noon, Bahen Center, BA 1190
 L0201: Mon., Wed. and Fri., 3-4pm, Lash Miller, LM 161
Tutorials Mon. 4-5pm, start Jan 15, in lecture room.
Course Information Sheet Handout
Course Bulletin Board
Email, B. Board Policy Responses to email and bulletin board queries may take 1 to 2 business days.
Final Exam The Faculty of Arts and Science will schedule the exam later in the spring. Look up the time and place on the Examinations page.

Marking Policy

See the Course Information Sheet.


Contact your College Registrar if you are unable to complete an assignment or attend either a midterm test or the final exam due to illness or injury. You will need to have a medical professional complete a Verification of Student Illness or Injury Form.

Current Marks

Your unofficial marks will be updated during the term on the CS Teaching website.


We take plagarism very seriously. Everything you hand in to be marked, namely assignments, tests and the final exam, must represent your own work. Read How not to plagarize.


Links to assignments and related information are (will be) provided here.
Percent Posting Date Due Date Links
A1 12% Jan 15 9:00am, Thurs, Jan 25  

Past Exams

Links to some previous CSC373 exams are provided by the Univ. of Toronto Libraries at old exams repository (search for CSC373H).

See the Previous Exam Study Guide for a table of exam questions that have been listed in terms of the major topic being tested, and roughly ranked by difficulty.

Lecture and Tutorial Materials

Links to some of the lecture notes and tutorial exercises are provided below.

My lecture slides are modified versions of those by Kevin Wayne.

Password for Lecture Notes. In order to respect the copyright, my lecture notes require a password to open them. The password will be announced in the first lecture. Please do not distribute it outside of this class. If you miss the first lecture, email me to ask for the password and include your UofT login name and student number.

Date Notes Optional Readings
Jan 5-12 Greedy Design 1 slide per page (1pp), 4 slides per page (4pp)

Greedy Graph Algorithms 1pp, 4pp (updated Jan 15, 2018)
Read Chapter 4, up to end of Sec. 4.7 of Kleinberg and Tardos.
Dijkstra demo 1pp, 4pp.
Mon, Jan 15
Greedy algorithm exercises Solutions
Jan 17-22 Divide and Conquer (1pp), (4pp)
Read Chapter 5, up to end of Sec. 5.5 of Kleinberg and Tardos.
Demo: Inversion Counting 1pp. 4pp.
Mon, Jan 22
MST exercises Solutions