DM508: Algorithms and Complexity

Announcements: None.
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).
  7. Note 7 (also in PDF).
  8. Note 8 (also in PDF).
  9. Note 9 (also in PDF).
  10. Note 10 (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 Jul 15 10:44:38 CEST 2011 - Joan Boyar 		   

 

   Data protection at SDU ▪ Databeskyttelse på SDU