The Undergrad Announcements (UGA) website contains announcements about things of importance to students, such as job and scholarship opportunities, academic and social events, and reminders of administrative deadlines.
CSC365H Announcements
Click here to check your unofficial final marks.
Click here for THIS year's final exam.
Problem Set 5 is marked is available from my office.
Click here for last year's final exam. (Earlier final exams available from last year's web site -- see below.)
Click here for the course discussion board.
Lectures: MW 2 in MP 118
Tutorial: F2 in MP 118
Tutor:
Instructor:
Stephen Cook
email: sacook@cs.toronto.edu
Office: Sandford Fleming 2303C, 416-978-5183
Office Hours: Mon 3:10-4:00, Thurs 2:30-3:30
Or make an appointment, or drop in.
E-MAIL QUESTIONS ARE WELCOME.
Text: "Introduction to the Theory of Computation", by Michael Sipser. (First or Second Edition.) Mainly chapters 3,4,5, and 7.
References:
M. Garey and D. Johnson: Computers and Intractability: A Guide to
the Theory of NP-Completeness. Chapters 1-3 especially relevant.
Cormen, Leiserson, Rivest, and Stein: Introduction to Algorithms (Second Edition), MIT Press and McGraw-Hill. Chapter 34 on NP-completeness is the relevant chapter here.
Marking Scheme:
Supplementary Lecture Notes (.ps files from CSC 364H)
CHECK OUT THE 2007 CSC365H web page for the previous year's problem sets and tests.Problem Sets (.ps files)