Skip to content

Downloads

The lecture notes and the exercise book in PDF, with the same numbering of definitions, theorems, examples and exercises as the website, and the slides of the chapters. Text and figures are released under CC BY 4.0, the code under the MIT licence.

Lecture notes

Volume Contents Chapters File
1. Dynamic programming The principles of dynamic programming and DP algorithms for knapsack problems, lot sizing, coin change and rod cutting: recurrences, pseudocode, complexity and worked tables. 1–13 PDF (1.3 MB)

Exercise book

Volume Contents Chapters File
1. Dynamic programming Principles · Knapsack problems · Lot sizing problems · Miscellaneous problems 1–13 PDF (1.0 MB)

Slides

The lecture slides, one PDF per chapter, with the same definitions and examples as the lecture notes.

Principles

Chapter Title File
1 Principles of dynamic programming PDF (0.3 MB)

Knapsack problems

Lot sizing problems

Miscellaneous problems

Chapter Title File
12 DP for the coin change problem PDF (0.5 MB)
13 DP for the rod cutting problem PDF (0.5 MB)

Quiz question bank

All the self-assessment questions, by part and chapter, with the correct answer and the explanation; for the generated questions, whose numbers change at every start, a few examples.

Question bank