OCR D2 — Question 1 7 marks

Exam BoardOCR
ModuleD2 (Decision Mathematics 2)
Marks7
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicDynamic Programming
TypeDynamic programming shortest/longest path
DifficultyModerate -0.5 This is a straightforward application of dynamic programming to find the minimum cost path through a small network. The problem requires only systematic backward induction through clearly defined stages with no conceptual challenges—easier than average A-level questions but not trivial due to the multi-stage calculation required.
Spec7.03a Algorithm definition: input, output, deterministic, finite7.03b Algorithm awareness: uses and practical limitations7.03c Working with algorithms: trace, interpret, adapt

  1. A couple are making the arrangements for their wedding. They are deciding whether to have the ceremony at their church, a local castle or a nearby registry office. The reception will then be held in a marquee, at the castle or at a local hotel. Both the castle and hotel offer catering services but the couple are also considering using Deluxe Catering or Cuisine, who can both provide the food at any venue.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{b8eb80d5-5af5-4a8b-8335-6fae95f3aa73-1_938_1514_520_248} \captionsetup{labelformat=empty} \caption{Fig. 1}
\end{figure} The network in Figure 1 shows the costs incurred (including transport), in hundreds of pounds, according to the choice the couple make for each stage of the day. Use dynamic programming to find how the couple can minimise the total cost of their wedding and state the total cost of this arrangement.

\begin{enumerate}
  \item A couple are making the arrangements for their wedding. They are deciding whether to have the ceremony at their church, a local castle or a nearby registry office. The reception will then be held in a marquee, at the castle or at a local hotel. Both the castle and hotel offer catering services but the couple are also considering using Deluxe Catering or Cuisine, who can both provide the food at any venue.
\end{enumerate}

\begin{figure}[h]
\begin{center}
  \includegraphics[alt={},max width=\textwidth]{b8eb80d5-5af5-4a8b-8335-6fae95f3aa73-1_938_1514_520_248}
\captionsetup{labelformat=empty}
\caption{Fig. 1}
\end{center}
\end{figure}

The network in Figure 1 shows the costs incurred (including transport), in hundreds of pounds, according to the choice the couple make for each stage of the day.

Use dynamic programming to find how the couple can minimise the total cost of their wedding and state the total cost of this arrangement.\\

\hfill \mbox{\textit{OCR D2  Q1 [7]}}