|   CSC 2410F - Introduction to Graph Theory - 2002 |
---|
Lecture: | Monday, Wednesday 11:00am-12:00pm, Thursday 9:00am-10:00am in RW229 | |
---|---|---|
![]() |
||
Instructor: | Derek G. Corneil, | |
Office: | Sandford Fleming 3301B, 416-978-8954 | |
![]() |
||
Tutor: | Lap Chi Lau, |
  |   Announcement |
---|
7 Jan |
The exams have been marked and the final marks submitted. The exams can
be picked up from the mail slots in the grad. lounge (SF3205) - note that
the room is unlocked during daytime hours. If you wish to appeal any aspect of the exam, please write a detailed explanation of why you feel you deserve more marks. The entire exam will be remarked and your final mark could go up, stay the same, or go down. The statistics for the exam are: 80s: 2 70s: 8 60s: 6 50s: 9 40s: 5 <40: 5 Average: 56.8 The statistics for the final grades are: A+: 3 A : 7 A-: 7 B+: 6 B : 7 B-: 1 Happy New Year. Derek |
|
IMPORTANT | Examination Instructions | |
HOT |
The precious old exams are posted 91 page 1     91 page 2     91 page 3     92 page 1     92 page 2     92 page 3     |
|
Nov. 11 | The exam will be held on Friday, December 6 from 2-7 pm. (The exam will be a 3 hour exam but to avoid time problems, 5 hours have been reserved.) The exam will be closed book and will be held in WI 1016 (WI = Wilson Hall, part of New College). |
  |   Course handout and assignments |
---|
Course Handout   Including marking scheme, course text book and course outline. |
Assignment | Out | Due | |
---|---|---|---|
a1.ps  a1.pdf | Sep. 26 | Oct. 10 | |
a2.ps  a2.pdf | Oct. 17 | Oct. 31 | |
a3.ps  a3.pdf | Nov. 7 | Nov. 21 |
  |   Useful links |
---|
Sept. 19 | CSC 364 course notes by Prof. Cook   More about computability and complexity. | |
Sept. 18 | Tutorial Notes 1   Algorithm and Turing Machine, asymptotic notation, P, NP, NP-complete, co-NP and polynomial time reduction. |