Announcement 1: The proof that SUBSET SUM is NP-Complete which I gave in class can be found in the first edition of your textbook. It is now on reserve in IMADA's library.
Exam questions for March 2008 are the same as for March 2007 (except
for the dates). See above.
Exam questions for DM508 for March-April 2009:Exam questions 2009.pdf.
Note that the slides for Cook's Theorem and a slide for the Matcher
algorithm for the KMP string matching algorithm will be available
at the exam.
Course evaluation from spring 2009:
Student
course evaluation summary and response.