AQA D1 (Decision Mathematics 1) 2011 January

1 Six people, \(A , B , C , D , E\) and \(F\), are to be allocated to six tasks, 1, 2, 3, 4, 5 and 6. The following bipartite graph shows the tasks that each of the people is able to undertake.
\includegraphics[max width=\textwidth, alt={}, center]{d1e453d6-0abb-4a7e-87c1-28275074dd08-02_1040_620_644_703}

1. Represent this information in an adjacency matrix.
2. Initially, \(B\) is assigned to task 5, \(D\) to task 2, \(E\) to task 4 and \(F\) to task 3. Demonstrate, by using an algorithm from this initial matching, how each person can be allocated to a task.

2 A student is using a quicksort algorithm to rearrange a set of numbers into ascending order. She uses the first number in each list (or sublist) as the pivot. Her correct solution for the first three passes is as follows.

1. State the pivots used for the 2nd pass.
2. Write down the number of comparisons on each of the three passes.
3. Explain whether the student has completed the algorithm.

3 The following network shows the lengths, in miles, of roads connecting nine villages, \(A , B , \ldots , I\).
\includegraphics[max width=\textwidth, alt={}, center]{d1e453d6-0abb-4a7e-87c1-28275074dd08-06_832_858_388_591}

1. 1. Use Prim's algorithm starting from \(E\), showing the order in which you select the edges, to find a minimum spanning tree for the network.
   2. State the length of your minimum spanning tree.
   3. Draw your minimum spanning tree.
2. On a particular day, village \(B\) is cut off, so its connecting roads cannot be used. Find the length of a minimum spanning tree for the remaining eight villages.
   (2 marks)
   \includegraphics[max width=\textwidth, alt={}, center]{d1e453d6-0abb-4a7e-87c1-28275074dd08-08_2486_1724_221_143}

5 Norris delivers newspapers to houses on an estate. The network shows the streets on the estate. The number on each edge shows the length of the street, in metres. Norris starts from the newsagents located at vertex \(A\), and he must walk along all the streets at least once before returning to the newsagents.
\includegraphics[max width=\textwidth, alt={}, center]{d1e453d6-0abb-4a7e-87c1-28275074dd08-10_1045_931_552_557} The total length of the streets is 1215 metres.

1. Give a reason why it is not possible to start at \(A\), walk along each street once only, and return to \(A\).
2. Find the length of an optimal Chinese postman route around the estate, starting and finishing at \(A\).
3. For an optimal Chinese postman route, state:
   1. the number of times that the vertex \(F\) would occur;
   2. the number of times that the vertex \(H\) would occur.
      \includegraphics[max width=\textwidth, alt={}]{d1e453d6-0abb-4a7e-87c1-28275074dd08-11_2486_1714_221_153}

6

1. The complete graph \(K _ { n }\) has every one of its \(n\) vertices connected to each of the other vertices by a single edge.
   1. Find the total number of edges in the graph \(K _ { 5 }\).
   2. State the number of edges in a minimum spanning tree for the graph \(K _ { 5 }\).
   3. State the number of edges in a Hamiltonian cycle for the graph \(K _ { 5 }\).
2. A simple graph \(G\) has six vertices and nine edges, and \(G\) is Eulerian. Draw a sketch to show a possible graph \(G\).
   \includegraphics[max width=\textwidth, alt={}]{d1e453d6-0abb-4a7e-87c1-28275074dd08-12_1844_1714_863_153}

7 Fred delivers bread to five shops, \(A , B , C , D\) and \(E\). Fred starts his deliveries at shop \(B\), and travels to each of the other shops once before returning to shop \(B\). Fred wishes to keep his travelling time to a minimum. The table shows the travelling times, in minutes, between the shops.

1. Find the travelling time for the tour \(B A C D E B\).
2. Use the nearest neighbour algorithm, starting at \(B\), to find another upper bound for the travelling time for Fred's tour.
3. By deleting \(C\), find a lower bound for the travelling time for Fred's tour.
4. Sketch a network showing the edges that give you the lower bound in part (c) and comment on its significance.

8 A student is tracing the following algorithm with positive integer values of \(A\) and \(B\).
The function INT gives the integer part of a number, eg INT(2.3) \(= 2\) and \(\operatorname { INT } ( 3.8 ) = 3\).

1. Trace the algorithm in the case where the input values are \(A = 20\) and \(B = 8\).
2. State the purpose of the algorithm.
3. Another student changed Line 50 to Line 50 If \(A = 1\) then go to Line 80
   Explain what would happen if this algorithm were traced.
   \includegraphics[max width=\textwidth, alt={}]{d1e453d6-0abb-4a7e-87c1-28275074dd08-17_2486_1714_221_153}

9 Herman is packing some hampers. Each day, he packs three types of hamper: basic, standard and luxury. Each basic hamper has 6 tins, 9 packets and 6 bottles.
Each standard hamper has 9 tins, 6 packets and 12 bottles.
Each luxury hamper has 9 tins, 9 packets and 18 bottles.
Each day, Herman has 600 tins and 600 packets available, and he must use at least 480 bottles. Each day, Herman packs \(x\) basic hampers, \(y\) standard hampers and \(z\) luxury hampers.

1. In addition to \(x \geqslant 0 , y \geqslant 0\) and \(z \geqslant 0\), find three inequalities in \(x , y\) and \(z\) that model the above constraints, simplifying each inequality.
2. On a particular day, Herman packs the same number of standard hampers as luxury hampers.
   1. Show that your answers in part (a) become $$\begin{aligned} x + 3 y & \leqslant 100
      3 x + 5 y & \leqslant 200
      x + 5 y & \geqslant 80 \end{aligned}$$
   2. On the grid opposite, draw a suitable diagram to represent Herman's situation, indicating the feasible region.
   3. Use your diagram to find the maximum total number of hampers that Herman can pack on that day.
   4. Find the number of each type of hamper that Herman packs that corresponds to your answer to part (b)(iii).
      (1 mark)