Subjects / LC Applied Mathematics / Dynamic programming (spec Strand 2)
Dynamic programming
Solve multi-stage decision problems by working backwards using Bellman's principle of optimality.
In review
5th Year6th Year HigherOrdinary
Helps to know first:
Shortest paths (Dijkstra's algorithm)
15practice questions
Match the pairs: 1 · Multiple choice: 6 · Numeric answer: 4 · Put in order: 2 · Short answer: 2
Each question has up to three hints, a worked explanation, and is tracked in your progress and review plan.
Practise this topic