Students should consult the forum at least once a week.
If you have a question, please check first the policies and the forum to see if your question is already answered. Email me if it isn't. I will only respond to emails sent to csc373 ☛ cs ☀ toronto ☀ edu .
You can also post non-personal questions (e.g. clarification requests about assignments, explanation requests for topics covered in lectures, etc.) on the forum so other students can also benefit from them.

Announcements

August 8
FINAL EXAM TOMORROW: TUESDAY AUGUST 9TH, 7-10PM EX300.
August 4
🦄 Review Session: Today 7-9PM.
🦄 Extra Office Hours: Friday Aug. 5th 4-6PM and Monday Aug 8th 5-7PM.
August 2
🦄 A3 has been extended to Friday, August 5th at 10PM. Check your emails for details.
July 17
🦄 Assignment 3 is up.
🦄 Room Change: Class will be held in SF 1101 from now on.
🦄 Thursday tutorial will be held in SF 3202. Wednesdays section will remain in GB 404.
July 10
🦄 There is no tutorial this week. Midterm 2 takes place on EX300 on Thursday 6-7PM.
🦄 Extra Office Hour on Monday (tomorrow) from 6-7PM.
June 19
🦄 Assignment 2 is up.
May 26
🦄 Assignment 1 has been extended to Sunday, June 12th at 10PM.
🦄 Lecture notes are up.
May 22
🦄 Assignment 1 is up.
May 18
🦄 Make sure you can login to MarkUS. If you can't, email me at csc373@.
🦄 New tutorial session to be held in GB 404 Wednesday 5-6PM.
May 12
🦄 Do not try to login to MarkUS. I haven't added any of you. DO NOT email admin@cdf.
🦄 Vote on Piazza for a potential second tutorial section.
🦄 Lecture notes are up.

Course Info

Instructor
   Name: Lalla Mouatadid
   Email: csc373 ☛ cs ☀ toronto ☀ edu
   Office: SF4306 D

Teaching Assistants
   Names: Akis Kattis, Nick Spooner, Atiyeh Ashari

Lectures
   When: Tuesday 6PM-7PM, Wednesday 6PM-9PM
   Where: GB 120

Tutorials
   When: Thursday 6PM-7PM
   Where: GB 120
   When: Wednesday 5PM-6PM
   Where: GB 404

Office Hours
   When: Wednesday 4PM-6PM
   Where: SF4306 D

Course Website
   http://www.cs.toronto.edu/~lalla/373s16/

Markus
   Markus for CSC373H

Course Forum
   Piazza forum for CSC373H
   We will be monitoring the board regularly to answer your questions.

Textbook
   [CLRS] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, "Introduction to Algorithms"
   3rd. ed., 2009. Errata.
   You have online access to the 2nd. edition through the UofT library.

Supplementary/Reference Book
   [DPV] Sanjoy Dasgupta, Christos H. Papadimitriou, and Umesh Vazirani, "Algorithms", 2006. Errata

   [JeffE] Jeff Erickson, "Algorithms Course Materials", 2011.
   You can download the complete version free of charge.

Other Books
   [GT] Michael T. Goodrich and Roberto Tamassia, Algorithm Design, Foundations, Analysis, and Internet Examples,
   2001.

   [KT] Jon Kleinberg and Éva Tardos, "Algorithm Design", 2005.

   [Skiena] Steven S. Skiena, "The Algorithm Design Manual", 2008.

   [TAOCP] Donald E. Knuth, "The Art of Computer Programming", 1997-∞.

Course Description

Standard algorithm design techniques:
divide-and-conquer, greedy strategies, dynamic programming, linear programming, randomization, network flows, approximation algorithms. Brief introduction to NP-completeness: polynomial time reductions, examples of various NP-complete problems, self-reducibility. Students will be expected to show good design principles and adequate skills at reasoning about the correctness and complexity of algorithms.
(from Faculty of Arts & Science Calender)

Tentative Course Outline


Introduction (1 week), Greedy Algorithms (2 weeks), Dynamic Programming (2 weeks), Network Flow (2 weeks), Linear Programming (2 weeks), NP-completeness (3 weeks), Coping with Hard Problems (1 weeks).

Prerequisites
   CSC263H1/CSC265H1,
   CGPA 3.0 or enrolment in a CSC Subject POSt.
   The prerequisite requirement is strictly enforced in this course.

Exclusion
   CSC375H1/CSC364H1.

Breadth Requirement
   The Physical and Mathematical Universes (5).

Marking Scheme



Title	Points	Notes
Participation	5	Actively engaging in lectures, tutorial attendance, picking up assignments and midterms
Assignments	15	Three assignments, each worth 5 points.
Midterm 1	20	1st midterm worth 20 points.
Midterm 2	20	2nd midterm worth 20 points.
Final Exam	40	To pass this course you must get at least 40% in the final exam.
Total	100


Course Information Sheet
   Information Sheet