OCR D2 2015 June — Question 4

Exam BoardOCR
ModuleD2 (Decision Mathematics 2)
Year2015
SessionJune
TopicFixed Point Iteration

4 Jeremy is planning a long weekend break during which he wants to photograph as many different churches as he can. He will start from his home, \(J\), on Friday morning and return to his home on Monday evening. Table 1, below, summarises the routes he can take each day and the number of churches that he will pass on each route. You may assume that the 28 churches in the table are all different. \begin{table}[h]
DayFromToNumber of churches
FridayJKayton\(K\)4
JLittle Elling\(L\)5
SaturdayKMoreton EmcombeM2
KNether Ensleigh\(N\)0
LNether Ensleigh\(N\)0
LPeacombe\(P\)4
SundayMRiver Ardan\(R\)0
NRiver Ardan\(R\)4
PSeabury\(S\)3
\(P\)Teebury\(T\)2
Monday\(R\)Jeremy's home\(J\)4
SJeremy's home\(J\)0
\(T\)Jeremy's home\(J\)0
\captionsetup{labelformat=empty} \caption{Table 1}
\end{table}
  1. Represent the information in the table as a directed network in which the vertices represent the places. You may code the place names using the letters, as above. Jeremy wants to use dynamic programming to find the route on which he will pass the greatest number of churches. The (stage; state) variables will represent the places where he stays overnight. \(J\) will have (stage; state) variable ( \(0 ; 0\) ) at the start of the journey and ( \(4 ; 0\) ) at the end. Table 2 shows the (stage; state) variables for all the other places. \begin{table}[h]
    Place\(K\)\(L\)\(M\)\(N\)\(P\)\(R\)\(S\)\(T\)
    Stage variable11222333
    State variable01012012
    \captionsetup{labelformat=empty} \caption{Table 2}
    \end{table}
  2. Set up a dynamic programming tabulation, working backwards from Monday to Friday, to find the route that Jeremy should take to pass the greatest number of churches. Write down Jeremy's route. You may code the place names using the letters, as above. Write down the number of churches that he will be able to photograph on this route.