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).
Announcement 2: The exam questions for this year will be the same as for last year.
Announcement 3: There will be no more lectures, and the last discussion section will be Tuesday in week 11.
Announcement 4: The sign-up sheet for the oral exam is with Lone in IMADA's office. If you don't write your own name on it, Lone will write your name on there for you.
Lecture notes:
  1. Note 1 (also in PDF).
  2. Note 2 (also in PDF).
  3. Note 3 (also in PDF).
  4. Note 4 (also in PDF).
  5. Note 5 (also in PDF).
  6. Note 6 (also in PDF). This contains the second assignment.
  7. Note 7 (also in PDF).
  8. Note 8 (also in PDF).
  9. Note 9 (also in PDF). This contains the third assignment.

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.
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.

   
IMADA HOME | SDU HOME | Previous page |
Last modified: Mon Mar 15 11:03:18 CET 2010 - Joan Boyar