Module: Dynamic Programming

Cut rod problem, longest common subsequence, matrix-chain multiplication, knapsack problem, optimal substructure.

Learning Outcomes

Apply dynamic programming to problem solving, including

Readings

Experiential Learning