DM551: Algorithms and Probability

  1. The first assignment has been posted.

  1. Assignment 1. Due 12:15 on Monday, October 22.

Textbooks and notes:
  1. Discrete Mathematics and Its Applications, 7th edition, by K. Rosen, McGraw Hill, 2013. Same textbook as used for Discrete Methods. This textbook will be used most, and we start with it.
  2. Introduction to Algorithms, 3rd edition, by T. Cormen, C. Leiserson, R. Rivest, and C. Stein, MIT Press, 2009. Same textbook as used for Algorithms and Data Structures.
  3. Extra notes (available from Course Materials in Blackboard): This includes chapter 13 from Algorithm Design, byt J. Kleinberg and É. Tardos, Addison Wesley, 2005.

Lecture notes and problems for discussions sections:
  1. Note 1. This includes general information about the course. Slides from lecture 1.
  2. Note 2. Slides from lecture 2.
  3. Note 3. Slides from lecture 3.
  4. Note 4. Slides from lecture 4.
  5. Note 5. Slides from lecture 5.
  6. Note 6. Slides from lecture 6.
  7. Note 7. Slides from lecture 7.
  8. Note 8. No slides used. Slides with most of what I covered from chapter 13 in Kleinberg and Tardos can be found on Kevin Wayne's homepage at Princeton. It says that they are the official slides from the publisher Pearson, for the textbook. Pearson's slides for chapter 13.
  9. Note 9. Slides from lecture 9.
  10. Note 10. Slides from lecture 10.
  11. Note 11.

Notes about proofs: Notes.
Teaching assistant ("instruktor") Kristine Knudsen
Kristine Knudsen's email address:
Exam information from 2017:
"Questions" and additional exam information (there will be some changes in 2018).

IMADA HOME | SDU HOME | Previous page | Joan Boyar


   Data protection at SDUDatabeskyttelse på SDU