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.
Announcement 2: There will be a very short possibility for a redo on the last assignment (if you have not already used up your redo). You need to pick up your graded assignment on Friday, March 9, and submit again by 10:15 on March 12.
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). Contains the second assignment.
  5. Note 5 (also in PDF).
  6. Note 6 (also in PDF).
  7. Note 7 (also in PDF). Contains the third (last) assignment (corrected).
  8. Note 8 (also in PDF).
  9. Note 9 (also in PDF).

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 March 26 and 27, 2012, 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.
Evaluation of course and response.

IMADA HOME | SDU HOME | Previous page |
Last modified: Thu Jul 25 12:24:39 CEST 2013 - Joan Boyar