Learning Resources
Use the reading guide for a bounded assignment and local file map. These are sources for specific questions, not a list to consume in full.
| Resource | Use it for | Required follow-through |
|---|---|---|
| The Algorithm Design Manual | Recurrence design, edit reconstruction, subset-state limits | Derive a state and explain a failure of a smaller one |
| Introduction to Algorithms | Rod cutting, matrix chains, optimal BSTs, greedy proofs | State assumptions and reconstruct one proof without the book |
| Competitive Programming | Additional sequence/grid/tree practice | Solve one selected task and change one constraint |
| Erickson: Dynamic Programming | Alternative free derivations and exercises | Compare state semantics, not just recurrence notation |
| MIT DP Part 1 | A systematic subproblem-design process | Produce a complete state/proof/cost card |
| MIT DP Part 3 | Parenthesization and augmented-state examples | Identify a dependency rank and missing state coordinate |
The offline labs, practice feedback and assessment key provide the core executable and solution support. Full-book review, external endorsement and learner-pilot results are not implied by listing a source.