Exercises · Grade 12
Sequential decisions and dynamic programming — Grade 12 math exercises
Open an exercise and the tutor guides you step by step: it asks questions and checks each step, without giving the answer.
- Exercise 1 — Choose before or after observing a state (easy)
- Exercise 2 — Find a least-cost path by working backward (easy)
- Exercise 3 — Build an adaptive two-stage policy (easy)
- Exercise 4 — Use a finite-horizon Bellman recurrence (medium)
- Exercise 5 — Include a limited resource in the state (medium)
- Exercise 6 — Account for the terminal boundary (medium)
- Exercise 7 — Allocate a budget without reusing a project (medium)
- Exercise 8 — Decide when to stop drawing (hard)
- Exercise 9 — Separate an expected-loss objective from a risk constraint (hard)
- Exercise 10 — Combine a ticket, a terminal penalty and an adaptive policy (hard)