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.
The principles of dynamic programming and DP algorithms for knapsack problems, lot sizing, coin change and rod cutting: recurrences, pseudocode, complexity and worked tables.
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.