DM508: Algorithms and Complexity

Announcement 1: Assignments should be turned in via Blackboard as exactly one PDF file (if you submit more than once, mark on your assignment which submission number it is). After the first assignment, a paper copy should *not* be turned in. Turn in only one assignment per group.
Lecture notes:
  1. Note 1 (also in PDF). Contains the first assignment.
  2. Note 2 (also in PDF).
  3. Note 3 (also in PDF).
  4. Note 4 (also in PDF).
  5. Note 5 (also in PDF).
E-mail address for teaching assistant ("instruktor"):
Slides for Cook's Theorem in PDF.
Exam questions for DM508 for March 2007: 05DM508questions.ps also in PDF.
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.
Exam questions for April 2010 are the same as for March-April 2009 (except for the dates). See above.
Exam questions for April 2011 are the same as for March-April 2009 (except for the dates). See above.
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.

   
IMADA HOME | SDU HOME | Previous page |
Last modified: Fri Feb 10 14:26:43 CET 2012 - Joan Boyar