The course will primarily be based on excerpts from the following books:

• Sara Baase, Allen Van Gelder Computer Algorithms: Introduction to Design and Analysis, 3rd eds. Pearson, 1999. [BG]
  (parts of chapter 5 - only available in Itslearning due to copyright rules)
• Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Introduction to Algorithms, 4th eds., MIT Press, 2022. ISBN 9780262046305. [CLRS]
• Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Introduction to Algorithms, 3rd eds., MIT Press, 2009. ISBN 9780262033848. [CLRS3rd]
  (via the 4th edition home page, click "Resources" and then "Materials Removed from 3e" to download a zip file containing, among many other things, the section on perfect hashing)
• Jon Kleinberg, Eva Tardos, Algorithm Design, Pearson, 2005. ISBN 9780321295354. [KT]
  (parts of chapter 13 - only available in Itslearning due to copyright rules)
• Kenneth H. Rosen, Discrete Mathematics and Its Applications, 8th eds., McGraw-Hill Educations, 2019. [Rosen]

Some parts may be made available on the learning platform. Which parts we will use will be announced later. In earlier courses, we have used some of these textbooks already [CLRS, Rosen]. Thus, if you have been enrolled at SDU from the beginning of your education, you may not need to buy any new books.

My (supplementary) errata to the books by

• Kleinberg & Tardos

Further material will be published as the courses progresses.

 

---