DM551/MM851: Algorithms and Probability

  1. If you do not have the 8th edition of Rosen's textbook, it is available on the McGraw-Hill webstore as an Ebook. I do not know if this is cheaper than through SDU's bookstore.

  1. None yet.

Textbooks and notes:
  1. Discrete Mathematics and Its Applications, 8th edition, by K. Rosen, McGraw Hill, 2019. 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, by J. Kleinberg and É. Tardos, Addison Wesley, 2005.

Lecture notes and problems for discussions sections:
  1. None yet.

Notes about proofs: Notes.
Teaching assistant ("instruktor") unknown

Exam information from 2017:
"Questions" and additional exam information (there will be some changes in 2018).
Exam information for 2018: (there will be some changes in 2020)
"Questions" and additional exam information.
"Pensum" (material students should know for the exam).

IMADA HOME | SDU HOME | Previous page | Joan Boyar


   Data protection at SDUDatabeskyttelse på SDU