Questions D1 - A-Level Maths

Browse by module

All questions AEA AS Paper 1 AS Paper 2 AS Pure C1 C12 C2 C3 C34 C4 CP AS CP1 CP2 D1 D2 F1 F2 F3 FD1 FD1 AS FD2 FD2 AS FM1 FM1 AS FM2 FM2 AS FP1 FP1 AS FP2 FP2 AS FP3 FS1 FS1 AS FS2 FS2 AS Further AS Paper 1 Further AS Paper 2 Discrete Further AS Paper 2 Mechanics Further AS Paper 2 Statistics Further Additional Pure Further Additional Pure AS Further Discrete Further Discrete AS Further Extra Pure Further Mechanics Further Mechanics A AS Further Mechanics AS Further Mechanics B AS Further Mechanics Major Further Mechanics Minor Further Numerical Methods Further Paper 1 Further Paper 2 Further Paper 3 Further Paper 3 Discrete Further Paper 3 Mechanics Further Paper 3 Statistics Further Paper 4 Further Pure Core Further Pure Core 1 Further Pure Core 2 Further Pure Core AS Further Pure with Technology Further Statistics Further Statistics A AS Further Statistics AS Further Statistics B AS Further Statistics Major Further Statistics Minor Further Unit 1 Further Unit 2 Further Unit 3 Further Unit 4 Further Unit 5 Further Unit 6 H240/01 H240/02 H240/03 M1 M2 M3 M4 M5 P1 P2 P3 P4 PMT Mocks PURE Paper 1 Paper 2 Paper 3 Pre-U 9794/1 Pre-U 9794/2 Pre-U 9794/3 Pre-U 9795 Pre-U 9795/1 Pre-U 9795/2 S1 S2 S3 S4 Unit 1 Unit 2 Unit 3 Unit 4

Browse by board

AQA AS Paper 1 AS Paper 2 C1 C2 C3 C4 D1 D2 FP1 FP2 FP3 Further AS Paper 1 Further AS Paper 2 Discrete Further AS Paper 2 Mechanics Further AS Paper 2 Statistics Further Paper 1 Further Paper 2 Further Paper 3 Discrete Further Paper 3 Mechanics Further Paper 3 Statistics M1 M2 M3 Paper 1 Paper 2 Paper 3 S1 S2 S3 CAIE FP1 FP2 Further Paper 1 Further Paper 2 Further Paper 3 Further Paper 4 M1 M2 P1 P2 P3 S1 S2 Edexcel AEA AS Paper 1 AS Paper 2 C1 C12 C2 C3 C34 C4 CP AS CP1 CP2 D1 D2 F1 F2 F3 FD1 FD1 AS FD2 FD2 AS FM1 FM1 AS FM2 FM2 AS FP1 FP1 AS FP2 FP2 AS FP3 FS1 FS1 AS FS2 FS2 AS M1 M2 M3 M4 M5 P1 P2 P3 P4 PMT Mocks PURE Paper 1 Paper 2 Paper 3 S1 S2 S3 S4 OCR AS Pure C1 C2 C3 C4 D1 D2 FD1 AS FM1 AS FP1 FP1 AS FP2 FP3 FS1 AS Further Additional Pure Further Additional Pure AS Further Discrete Further Discrete AS Further Mechanics Further Mechanics AS Further Pure Core 1 Further Pure Core 2 Further Pure Core AS Further Statistics Further Statistics AS H240/01 H240/02 H240/03 M1 M2 M3 M4 PURE S1 S2 S3 S4 OCR MEI AS Paper 1 AS Paper 2 C1 C2 C3 C4 D1 D2 FP1 FP2 FP3 Further Extra Pure Further Mechanics A AS Further Mechanics B AS Further Mechanics Major Further Mechanics Minor Further Numerical Methods Further Pure Core Further Pure Core AS Further Pure with Technology Further Statistics A AS Further Statistics B AS Further Statistics Major Further Statistics Minor M1 M2 M3 M4 Paper 1 Paper 2 Paper 3 S1 S2 S3 S4 Pre-U Pre-U 9794/1 Pre-U 9794/2 Pre-U 9794/3 Pre-U 9795 Pre-U 9795/1 Pre-U 9795/2 WJEC Further Unit 1 Further Unit 2 Further Unit 3 Further Unit 4 Further Unit 5 Further Unit 6 Unit 1 Unit 2 Unit 3 Unit 4

Sort by: Default | Easiest first | Hardest first

AQA D1 2005 June Q2

8 marks Moderate -0.8

2 A father is going to give each of his five daughters: Grainne ( $G$ ), Kath ( $K$ ), Mary ( $M$ ), Nicola ( $N$ ) and Stella ( $S$ ), one of the five new cars that he has bought: an Audi ( $A$ ), a Ford Focus ( $F$ ), a Jaguar ( $J$ ), a Peugeot ( $P$ ) and a Range Rover ( $R$ ). The daughters express preferences for the car that they would like to be given, as shown in the table.

	Preferences
Grainne ( $G$ )	Audi $( A )$ or Peugeot ( $P$ )
Kath ( $K$ )	Peugeot ( $P$ ) or Ford Focus ( $F$ )
Mary ( $M$ )	Jaguar ( $J$ ) or Range Rover ( $R$ )
Nicola ( $N$ )	Audi $( A )$ or Ford Focus ( $F$ )
Stella ( $S$ )	Jaguar ( $J$ ) or Audi ( $A$ )

Show all these preferences on a bipartite graph.
Initially the father allocates the Peugeot to Kath, the Jaguar to Mary, and the Audi to Nicola. Demonstrate, by using alternating paths from this initial matching, how each daughter can be matched to a car which is one of her preferences.
(6 marks)

AQA D1 2005 June Q3

11 marks Moderate -0.3

3 A theme park has 11 rides, $A , B , \ldots K$. The network shows the distances, in metres, between pairs of rides. The rides are to be connected by cabling so that information can be collated. The manager of the theme park wishes to use the minimum amount of cabling. \includegraphics[max width=\textwidth, alt={}, center]{a1290c22-f28d-42aa-89d5-10d60ca4741c-03_988_1575_488_248}

Use Prim's algorithm, starting from $A$, to find the minimum spanning tree for the network.
State the length of cabling required.
Draw your minimum spanning tree.
The manager decides that the edge $A E$ must be included. Find the extra length of cabling now required to give the smallest spanning tree that includes $A E$.

AQA D1 2005 June Q4

7 marks Easy -1.2

In the complete graph $\mathrm { K } _ { 7 }$, every one of the 7 vertices is connected to each of the other 6 vertices by a single edge. Find or write down:
1. the number of edges in the graph;
2. the number of edges in a minimum spanning tree;
3. the number of edges in a Hamiltonian cycle.
1. Explain why the graph $\mathrm { K } _ { 7 }$ is Eulerian.
2. Write down the condition for $\mathrm { K } _ { n }$ to be Eulerian.
A connected graph has 6 vertices and 10 edges. Draw an example of such a graph which is Eulerian.

AQA D1 2005 June Q5

8 marks Easy -1.2

5 A student is using the following algorithm with different values of $X$.

LINE 10	INPUT $X$
LINE 20	LET $K = 1$
LINE 30	LET $Y = \left( X ^ { * } X + 16 \right) / \left( 2 ^ { * } X \right)$
LINE 40	PRINT $Y$
LINE 50	LET $X = Y$
LINE 60	LET $K = K + 1$
LINE 70	IF $K = 4$ THEN GO TO LINE 90
LINE 80	GO TO LINE 30
LINE 90	STOP

Trace the algorithm, giving your answers to three decimal places where appropriate:
1. in the case where the input value of $X$ is 2 ;
2. in the case where the input value of $X$ is - 6 .
Another student used the same algorithm but omitted LINE 70. Describe the outcome for this student.

AQA D1 2005 June Q6

13 marks Moderate -0.5

6 Mia is on holiday in Venice. There are five places she wishes to visit: Rialto $( R )$, St Mark's $( S )$, Murano ( $M$ ), Burano ( $B$ ) and Lido ( $L$ ). Boat services connect the five places. The table shows the times, in minutes, to travel between the places. Mia wishes to keep her travelling time to a minimum.

	Rialto ( $R$ )	St Mark's ( $S$ )	Murano ( $M$ )	Burano (B)	Lido (L)
Rialto ( $R$ )	-	15	55	75	25
St Mark's ( $S$ )	15	-	90	60	20
Murano ( $M$ )	55	90	-	25	80
Burano (B)	75	60	25	-	50
Lido ( $L$ )	25	20	80	50	-

1. Find the length of the tour $S R M B L S$.
2. Find the length of the tour using the nearest neighbour algorithm starting from $S$.
By deleting Burano ( $B$ ), find a lower bound for the length of the minimum tour.
Sketch a network showing the edges that give the lower bound found in part (b) and comment on its significance.

AQA D1 2005 June Q7

10 marks Moderate -0.3

7 [Figure 1, printed on the insert, is provided for use in this question.]
The diagram shows some of the main roads connecting Royton to London. The numbers on the edges represent the travelling times, in minutes, between adjacent towns. David lives in Royton and is planning to travel along some of the roads to a meeting in London. \includegraphics[max width=\textwidth, alt={}, center]{a1290c22-f28d-42aa-89d5-10d60ca4741c-06_2196_1479_557_310}

1. Use Dijkstra's algorithm on Figure 1 to find the minimum travelling time from Royton to London.
2. Write down the route corresponding to this minimum travelling time.
On a particular day, before David leaves Royton, he knows that the road connecting Walsall and Marston is closed. Find the minimum extra time required to travel from Royton to London on this day. Write down the corresponding route.

AQA D1 2005 June Q8

13 marks Easy -1.2

8 [Figure 2, printed on the insert, is provided for use in this question.]
A company makes two types of boxes of chocolates, executive and luxury.
Every hour the company must make at least 15 of each type and at least 35 in total.
Each executive box contains 20 dark chocolates and 12 milky chocolates.
Each luxury box contains 10 dark chocolates and 18 milky chocolates.
Every hour the company has 600 dark chocolates and 600 milky chocolates available.
The company makes a profit of $\pounds 1.50$ on each executive box and $\pounds 1$ on each luxury box.
The company makes and sells $x$ executive boxes and $y$ luxury boxes every hour.
The company wishes to maximise its hourly profit, $\pounds P$.

Show that one of the constraints leads to the inequality $2 x + 3 y \leqslant 100$.
Formulate the company's situation as a linear programming problem.
On Figure 2, draw a suitable diagram to enable the problem to be solved graphically, indicating the feasible region and an objective line.
Use your diagram to find the maximum hourly profit.

AQA D1 2006 June Q1

6 marks Easy -1.2

1 Five people, $A , B , C , D$ and $E$, are to be matched to five tasks, 1, 2, 3, 4 and 5. The table shows which tasks each person can do.

Person	Tasks
$A$	$1,3,5$
$B$	2,4
$C$	2
$D$	4,5
$E$	3,5

Show this information on a bipartite graph.
Initially $A$ is matched to task 3, $B$ to task 4, $C$ to task 2 and $E$ to task 5 . Use an alternating path from this initial matching to find a complete matching.

AQA D1 2006 June Q2

8 marks Easy -1.8

Use a shuttle sort to rearrange the following numbers into ascending order. $$\begin{array} { l l l l l l l l } 18 & 2 & 12 & 7 & 26 & 19 & 16 & 24 \end{array}$$
State the number of comparisons and swaps (exchanges) for each of the first three passes.

AQA D1 2006 June Q3

14 marks Standard +0.3

3 [Figure 1, printed on the insert, is provided for use in part (b) of this question.]
The diagram shows a network of roads. The number on each edge is the length, in kilometres, of the road. \includegraphics[max width=\textwidth, alt={}, center]{63e7775d-2a63-4584-b3be-ce97927bcfcc-03_716_1303_559_388}

1. Use Prim's algorithm, starting from $A$, to find a minimum spanning tree for the network.
2. State the length of your minimum spanning tree.
1. Use Dijkstra's algorithm on Figure 1 to find the shortest distance from $A$ to $J$.
2. A new road, of length $x \mathrm {~km}$, is built connecting $I$ to $J$. The minimum distance from $A$ to $J$ is reduced by using this new road. Find, and solve, an inequality for $x$.

AQA D1 2006 June Q4

11 marks Standard +0.8

4 The diagram shows a network of roads connecting 6 villages. The number on each edge is the length, in miles, of the road. \includegraphics[max width=\textwidth, alt={}, center]{63e7775d-2a63-4584-b3be-ce97927bcfcc-04_670_1298_466_356} Total length of the roads $= 164$ miles

A police patrol car based at village $A$ has to travel along each road at least once before returning to $A$. Find the length of an optimal 'Chinese postman' route for the police patrol car.
A council worker starts from $A$ and travels along each road at least once before finishing at $C$. Find the length of an optimal route for the council worker.
A politician is to travel along all the roads at least once. He can start his journey at any village and can finish his journey at any village.
1. Find the length of an optimal route for the politician.
2. State the vertices from which the politician could start in order to achieve this optimal route.

AQA D1 2006 June Q5

18 marks Moderate -0.8

5 [Figure 2, printed on the insert, is provided for use in this question.]

Gill is solving a travelling salesperson problem.
1. She finds the following upper bounds: 7.5, 8, 7, 7.5, 8.5. Write down the best upper bound.
2. She finds the following lower bounds: $6.5,7,6.5,5,7$. Write down the best lower bound.
George is travelling by plane to a number of cities. He is to start at $F$ and visit each of the other cities at least once before returning to $F$. The diagram shows the times of flights, in hours, between cities. Where no time is shown, there is no direct flight available. \includegraphics[max width=\textwidth, alt={}, center]{63e7775d-2a63-4584-b3be-ce97927bcfcc-05_936_826_1162_589}
1. Complete Figure 2 to show the minimum times to travel between all pairs of cities.
2. Find an upper bound for the minimum total flying time by using the route FTPOMF.
3. Using the nearest neighbour algorithm starting from $F$, find an upper bound for the minimum total flying time.
4. By deleting $F$, find a lower bound for the minimum total flying time.

AQA D1 2006 June Q6

18 marks Moderate -0.8

6 [Figure 3, printed on the insert, is provided for use in this question.]
Ernesto is to plant a garden with two types of tree: palms and conifers.
He is to plant at least 10, but not more than 80 palms.
He is to plant at least 5 , but not more than 40 conifers.
He cannot plant more than 100 trees in total. Each palm needs 20 litres of water each day and each conifer needs 60 litres of water each day. There are 3000 litres of water available each day. Ernesto makes a profit of $\pounds 2$ on each palm and $\pounds 1$ on each conifer that he plants and he wishes to maximise his profit. Ernesto plants $x$ palms and $y$ conifers.

Formulate Ernesto's situation as a linear programming problem.
On Figure 3, draw a suitable diagram to enable the problem to be solved graphically, indicating the feasible region and the direction of the objective line.
Find the maximum profit for Ernesto.
Ernesto introduces a new pricing structure in which he makes a profit of $\pounds 1$ on each palm and $\pounds 4$ on each conifer. Find Ernesto's new maximum profit and the number of each type of tree that he should plant to obtain this maximum profit.

AQA D1 2006 June Q7

6 marks Moderate -0.8

7 A connected graph $\mathbf { G }$ has $m$ vertices and $n$ edges.

1. Write down the number of edges in a minimum spanning tree of $\mathbf { G }$.
2. Hence write down an inequality relating $m$ and $n$.
The graph $\mathbf { G }$ contains a Hamiltonian cycle. Write down the number of edges in this cycle.
In the case where $\mathbf { G }$ is Eulerian, draw a graph of $\mathbf { G }$ for which $m = 6$ and $n = 12$.

AQA D1 2007 June Q1

9 marks Moderate -0.8

1 Six people, $A , B , C , D , E$ and $F$, are to be matched to six tasks, $1,2,3,4,5$ and 6 . The following adjacency matrix shows the possible matching of people to tasks.

	Task 1	Task 2	Task 3	Task 4	Task 5	Task 6
A	0	1	0	1	0	0
B	1	0	1	0	1	0
$\boldsymbol { C }$	0	0	1	0	1	1
D	0	0	0	1	0	0
E	0	1	0	0	0	1
$\boldsymbol { F }$	0	0	0	1	1	0

Show this information on a bipartite graph.
At first $F$ insists on being matched to task 4. Explain why, in this case, a complete matching is impossible.
To find a complete matching $F$ agrees to be assigned to either task 4 or task 5. Initially $B$ is matched to task 3, $C$ to task 6, $E$ to task 2 and $F$ to task 4.
From this initial matching, use the maximum matching algorithm to obtain a complete matching. List your complete matching.

AQA D1 2007 June Q2

8 marks Easy -1.2

Use a Shell sort to rearrange the following numbers into ascending order, showing the new arrangement after each pass. $$\begin{array} { l l l l l l l l } 28 & 22 & 20 & 17 & 14 & 11 & 6 & 5 \end{array}$$
1. Write down the number of comparisons on the first pass.
2. Write down the number of swaps on the first pass.
Find the total number of comparisons needed to rearrange the original list of 8 numbers into ascending order using a shuttle sort.
(You do not need to perform a shuttle sort.)

AQA D1 2007 June Q3

11 marks Moderate -0.5

3 [Figure 1, printed on the insert, is provided for use in this question.]
The following network represents the footpaths connecting 12 buildings on a university campus. The number on each edge represents the time taken, in minutes, to walk along a footpath. \includegraphics[max width=\textwidth, alt={}, center]{eb305e75-0e85-4f99-8f04-27046a153532-03_899_1317_589_356}

1. Use Dijkstra's algorithm on Figure 1 to find the minimum time to walk from $A$ to $L$.
2. State the corresponding route.
A new footpath is to be constructed. There are two possibilities:
from $A$ to $D$, with a walking time of 30 minutes; or from $A$ to $I$, with a walking time of 20 minutes. Determine which of the two alternative new footpaths would reduce the walking time from $A$ to $L$ by the greater amount.
(3 marks)

AQA D1 2007 June Q4

17 marks Moderate -0.5

4 The diagram shows the various ski-runs at a ski resort. There is a shop at $S$. The manager of the ski resort intends to install a floodlighting system by placing a floodlight at each of the 12 points $A , B , \ldots , L$ and at the shop at $S$. The number on each edge represents the distance, in metres, between two points. \includegraphics[max width=\textwidth, alt={}, center]{eb305e75-0e85-4f99-8f04-27046a153532-04_842_830_577_607} Total of all edges $= 1135$

The manager wishes to use the minimum amount of cabling, which must be laid along the ski-runs, to connect the 12 points $A , B , \ldots , L$ and the shop at $S$.
1. Starting from the shop, and showing your working at each stage, use Prim's algorithm to find the minimum amount of cabling needed to connect the shop and the 12 points.
2. State the length of your minimum spanning tree.
3. Draw your minimum spanning tree.
4. The manager used Kruskal's algorithm to find the same minimum spanning tree. Find the seventh and the eighth edges that the manager added to his spanning tree.
At the end of each day a snow plough has to drive at least once along each edge shown in the diagram in preparation for the following day's skiing. The snow plough must start and finish at the point $L$. Use the Chinese Postman algorithm to find the minimum distance that the snow plough must travel.
(6 marks)

AQA D1 2007 June Q5

16 marks Moderate -0.8

5 [Figure 2, printed on the insert, is provided for use in this question.]
The Jolly Company sells two types of party pack: excellent and luxury.
Each excellent pack has five balloons and each luxury pack has ten balloons.
Each excellent pack has 32 sweets and each luxury pack has 8 sweets.
The company has 1500 balloons and 4000 sweets available.
The company sells at least 50 of each type of pack and at least 140 packs in total.
The company sells $x$ excellent packs and $y$ luxury packs.

Show that the above information can be modelled by the following inequalities. $$x + 2 y \leqslant 300 , \quad 4 x + y \leqslant 500 , \quad x \geqslant 50 , \quad y \geqslant 50 , \quad x + y \geqslant 140$$ (4 marks)
The company sells each excellent pack for 80 p and each luxury pack for $\pounds 1.20$. The company needs to find its minimum and maximum total income.
1. On Figure 2, draw a suitable diagram to enable this linear programming problem to be solved graphically, indicating the feasible region and an objective line.
2. Find the company's maximum total income and state the corresponding number of each type of pack that needs to be sold.
3. Find the company's minimum total income and state the corresponding number of each type of pack that needs to be sold.

AQA D1 2007 June Q6

14 marks Easy -1.2

Mark is staying at the Grand Hotel ( $G$ ) in Oslo. He is going to visit four famous places in Oslo: Aker Brygge ( $A$ ), the National Theatre ( $N$ ), Parliament House ( $P$ ) and the Royal Palace ( $R$ ). The figures in the table represent the walking times, in seconds, between the places.

	Grand Hotel ( $G$ )	Aker Brygge (A)	National Theatre ( $N$ )	Parliament House (P)	Royal Palace (R)
Grand Hotel ( $G$ )	-	165	185	65	160
Aker Brygge (A)	165	-	155	115	275
National Theatre ( $N$ )	185	155	-	205	125
Parliament House (P)	65	115	205	-	225
Royal Palace (R)	160	275	125	225	-

Mark is to start his tour from the Grand Hotel, visiting each place once before returning to the Grand Hotel. Mark wishes to keep his walking time to a minimum.

Use the nearest neighbour algorithm, starting from the Grand Hotel, to find an upper bound for the walking time for Mark's tour.
By deleting the Grand Hotel, find a lower bound for the walking time for Mark's tour.
The walking time for an optimal tour is $T$ seconds. Use your answers to parts (a)(i) and (a)(ii) to write down a conclusion about $T$.

Mark then intends to start from the Grand Hotel ( $G$ ), visit three museums, Ibsen ( $I$ ), Munch ( $M$ ) and Viking ( $V$ ), and return to the Grand Hotel. He uses public transport. The table shows the minimum travelling times, in minutes, between the places.

\backslashbox{From}{To}	Grand Hotel ( $G$ )	Ibsen (I)	Munch ( $M$ )	Viking ( $\boldsymbol { V }$ )
Grand Hotel ( $\boldsymbol { G }$ )	-	20	17	30
Ibsen (I)	15	-	32	16
Munch (M)	26	18	-	21
Viking ( $\boldsymbol { V }$ )	19	27	24	-

Find the length of the tour $G I M V G$.
Find the length of the tour GVMIG.
Find the number of different possible tours for Mark.
Write down the number of different possible tours for Mark if he were to visit $n$ museums, starting and finishing at the Grand Hotel.

AQA D1 2014 June Q1

6 marks Moderate -0.8

1 Five people, $A , B , C , D$ and $E$, are to be allocated to five tasks, 1, 2, 3, 4 and 5 . The following bipartite graph shows the tasks that each person is able to undertake. \includegraphics[max width=\textwidth, alt={}, center]{5ee6bc88-6343-4ee6-8ecd-c13868d77049-02_441_437_699_797}

Represent this information in an adjacency matrix.
Initially, $A$ is allocated to task 3, $B$ to task 2 and $C$ to task 4.
1. Demonstrate, by using an alternating-path algorithm from this initial matching, how each person can be allocated to a different task.
2. Find a different allocation of people to tasks.

AQA D1 2014 June Q2

11 marks Moderate -0.8

2 A document which is currently written in English is to be translated into six other European Union languages. The cost of translating a document varies, as it is harder to find translators for some languages. The costs, in euros, are shown in the table below.

1. On the table below, showing the order in which you select the edges, use Prim's algorithm, starting from $E$, to find a minimum spanning tree for the graph connecting $D , E , F , G , H , I$ and $S$.
2. Find the length of your minimum spanning tree.
3. Draw your minimum spanning tree.

It is given that the graph has a unique minimum spanning tree. State the final two edges that would be added to complete the minimum spanning tree in the case where:

Prim's algorithm starting from $H$ is used;

Kruskal's algorithm is used. \begin{table}[h]

\captionsetup{labelformat=empty} \caption{Answer space for question 2}

	Danish ( $\boldsymbol { D }$ )	English ( $\boldsymbol { E }$ )	French (F)	German ( $G$ )	Hungarian (H)	Italian (I)	Spanish $\boldsymbol { ( } \boldsymbol { S } \boldsymbol { ) }$
Danish (D)	-	120	140	80	170	140	140
English ( $\boldsymbol { E }$ )	120	-	70	80	130	130	110
French (F)	140	70	-	90	190	85	90
German ( $G$ )	80	80	90	-	110	100	100
Hungarian (H)	170	130	190	110	-	140	150
Italian (I)	140	130	85	100	140	-	60
Spanish ( $\boldsymbol { S }$ )	140	110	90	100	150	60	-

\end{table}

AQA D1 2014 June Q3

10 marks Moderate -0.3

3 The network below shows 11 towns, $A , B , \ldots , K$. The number on each edge shows the time, in minutes, to travel between a pair of towns.

1. Use Dijkstra's algorithm on the diagram below to find the minimum time to travel from $A$ to $K$.
2. State the corresponding route.
On a particular day, Jenny travels from $A$ to $K$ but visits her friend at $D$ on her way. Find Jenny's minimum travelling time.
On a different day, all roads connected to $I$ are closed due to flooding. Jenny does not visit her friend at $D$. Find her minimum time to travel from $A$ to $K$. State the route corresponding to this minimum time.
[0pt] [2 marks] \section*{Answer space for question 3}
\includegraphics[max width=\textwidth, alt={}]{5ee6bc88-6343-4ee6-8ecd-c13868d77049-06_1478_1548_1213_239}

AQA D1 2014 June Q4

10 marks Moderate -0.3

4 Paulo sells vegetables from his van. He drives around the streets of a small village. The network shows the streets in the village. The number on each edge shows the time, in minutes, to drive along that street. Paulo starts from his house located at vertex $A$ and drives along all the streets at least once before returning to his house. \includegraphics[max width=\textwidth, alt={}, center]{5ee6bc88-6343-4ee6-8ecd-c13868d77049-10_1518_1605_598_198} The total of all the times in the diagram is 79.5 minutes.

Find the length of an optimal Chinese postman route around the village, starting and finishing at $A$. (Shortest routes between vertices may be found by inspection.)
For an optimal Chinese postman route, state:
1. the number of times the vertex $F$ would occur;
2. the number of times the vertex $D$ would occur.
Toto is standing for the position of Mayor in the local elections. He intends to travel along all the roads at least once. He can start his journey at any vertex and can finish his journey at any vertex.
1. Find the length of an optimal route for Toto.
  [0pt]
2. State the vertices from which Toto could start in order to achieve this optimal route. [3 marks]

AQA D1 2014 June Q5

11 marks Moderate -0.8

5 The feasible region of a linear programming problem is determined by the following: $$\begin{aligned} x & \geqslant 1 \\ y & \geqslant 3 \\ x + y & \geqslant 5 \\ x + y & \leqslant 12 \\ 3 x + 8 y & \leqslant 64 \end{aligned}$$

On the grid below, draw a suitable diagram to represent the inequalities and indicate the feasible region.
Use your diagram to find, on the feasible region:
1. the maximum value of $3 x + y$;
2. the maximum value of $2 x + 3 y$;
3. the minimum value of $- 2 x + y$. In each case, state the coordinates of the point corresponding to your answer.
  [0pt] [6 marks]

	Preferences
Grainne ( \(G\) )	Audi \(( A )\) or Peugeot ( \(P\) )
Kath ( \(K\) )	Peugeot ( \(P\) ) or Ford Focus ( \(F\) )
Mary ( \(M\) )	Jaguar ( \(J\) ) or Range Rover ( \(R\) )
Nicola ( \(N\) )	Audi \(( A )\) or Ford Focus ( \(F\) )
Stella ( \(S\) )	Jaguar ( \(J\) ) or Audi ( \(A\) )

Person	Tasks
\(A\)	\(1,3,5\)
\(B\)	2,4
\(C\)	2
\(D\)	4,5
\(E\)	3,5

LINE 10	INPUT \(X\)
LINE 20	LET \(K = 1\)
LINE 30	LET \(Y = \left( X ^ { * } X + 16 \right) / \left( 2 ^ { * } X \right)\)
LINE 40	PRINT \(Y\)
LINE 50	LET \(X = Y\)
LINE 60	LET \(K = K + 1\)
LINE 70	IF \(K = 4\) THEN GO TO LINE 90
LINE 80	GO TO LINE 30
LINE 90	STOP

	Rialto ( \(R\) )	St Mark's ( \(S\) )	Murano ( \(M\) )	Burano (B)	Lido (L)
Rialto ( \(R\) )	-	15	55	75	25
St Mark's ( \(S\) )	15	-	90	60	20
Murano ( \(M\) )	55	90	-	25	80
Burano (B)	75	60	25	-	50
Lido ( \(L\) )	25	20	80	50	-

	Grand Hotel ( \(G\) )	Aker Brygge (A)	National Theatre ( \(N\) )	Parliament House (P)	Royal Palace (R)
Grand Hotel ( \(G\) )	-	165	185	65	160
Aker Brygge (A)	165	-	155	115	275
National Theatre ( \(N\) )	185	155	-	205	125
Parliament House (P)	65	115	205	-	225
Royal Palace (R)	160	275	125	225	-

	Danish ( \(\boldsymbol { D }\) )	English ( \(\boldsymbol { E }\) )	French (F)	German ( \(G\) )	Hungarian (H)	Italian (I)	Spanish \(\boldsymbol { ( } \boldsymbol { S } \boldsymbol { ) }\)
Danish (D)	-	120	140	80	170	140	140
English ( \(\boldsymbol { E }\) )	120	-	70	80	130	130	110
French (F)	140	70	-	90	190	85	90
German ( \(G\) )	80	80	90	-	110	100	100
Hungarian (H)	170	130	190	110	-	140	150
Italian (I)	140	130	85	100	140	-	60
Spanish ( \(\boldsymbol { S }\) )	140	110	90	100	150	60	-

Questions D1 (932 questions)

Browse by module

Browse by board

AQA D1 2005 June Q2

AQA D1 2005 June Q3

AQA D1 2005 June Q4

AQA D1 2005 June Q5

AQA D1 2005 June Q6

AQA D1 2005 June Q7

AQA D1 2005 June Q8

AQA D1 2006 June Q1

AQA D1 2006 June Q2

AQA D1 2006 June Q3

AQA D1 2006 June Q4

AQA D1 2006 June Q5

AQA D1 2006 June Q6

AQA D1 2006 June Q7

AQA D1 2007 June Q1

AQA D1 2007 June Q2

AQA D1 2007 June Q3

AQA D1 2007 June Q4

AQA D1 2007 June Q5

AQA D1 2007 June Q6

AQA D1 2014 June Q1

AQA D1 2014 June Q2

AQA D1 2014 June Q3

AQA D1 2014 June Q4

AQA D1 2014 June Q5