CSC373H Winter 2014|
Algorithm Design, Analysis, and Complexity
|Course Information||Announcements||Topics and Timetable||Assignments, Tests, Solutions||Policies||Links||Forum|
Students should consult the forum at least once a week.
Please 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.
- Name: Robert Robere
- Email: robere AT cs DOT toronto DOT edu
- Office: SF-4306D
- Teaching Assistants
- Names: David Yu Cheng Chan, Lalla Mouatadid, Joel Oren, Dhinakaran Vinayagamurthy
- When: Mondays, Wednesdays, and Fridays 11AM-12AM
- Where: WI-1016
- When: Monday 4PM-5PM (Begins January 13th)
- Where: WI-1016
- Office Hours
- When: Tuesdays and Fridays at 3:00pm
- Where: SF-4306D
- Course Website
- Course Forum
- Piazza forum for CSC373H
We will be monitoring the board regularly to answer your questions.
- [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).
CGPA 3.0 or enrolment in a CSC Subject POSt.
- The prerequisite requirement is strictly enforced in this course.
- 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
Three assignments, each worth 10 points.
One midterm worth 10 points.
Programming Project 15
One programming project worth 15 points.
Final Exam 40
To pass this course you must get at least 40% in the final exam.
- Course Information Sheet
- Information Sheet
This page was last updated on Dec. 17, 2013.