| Exam Board | Edexcel |
|---|---|
| Module | D2 (Decision Mathematics 2) |
| Year | 2006 |
| Session | June |
| Marks | 4 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Dynamic Programming |
| Type | Dynamic programming minimax route |
| Difficulty | Easy -1.8 This is a pure recall question worth only 4 marks, requiring students to state a principle, define a term, and describe an application. No calculations, problem-solving, or mathematical reasoning required—just memorization of definitions and a simple practical example. |
| Spec | 7.04f Network problems: choosing appropriate algorithm |
\begin{enumerate}[label=(\alph*)]
\item State Bellman's principle of optimality. [1]
\item Explain what is meant by a minimax route. [1]
\item Describe a practical problem that would require a minimax route as its solution. [2]
\end{enumerate}
(Total 4 marks)
\hfill \mbox{\textit{Edexcel D2 2006 Q1 [4]}}