DM508: Algorithms and Complexity


Announcements: We will meet in U24 on Mondays from now on.
Lecture notes:
  1. Note 1 Contains the first assignment.
  2. Note 2
  3. Note 3
  4. Note 4
  5. Note 5 Contains the second assignment.
  6. Note 6
  7. Note 7
  8. Note 8
  9. Note 9 Contains the third assignment.
  10. Note 10

E-mail address for teaching assistant ("instruktor"):
Slides for Cook's Theorem in PDF.

Exam questions for DM508 for March-April 2009: Exam questions 2009.pdf.
Exam questions for June 20 and 21, 2013, 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 (from page 1005 in the textbook) will be available at the exam.
Reading list for exam for DM508: Reading list.pdf.

   
IMADA HOME | SDU HOME | Previous page |
Last modified: Mon May 13 13:10:17 CEST 2013 - Joan Boyar