2406 8FM0-27 AS Decision Mathematics 1 - June 2024 PDF
2406 8FM0-27 AS Decision Mathematics 1 - June 2024 PDF
Advanced Subsidiary
Further Mathematics options
27: Decision Mathematics 1
(Part of options D, F, H and K)
You must have:
Mathematical Formulae and Statistical Tables (Green), calculator,
D1 Answer Book (enclosed)
Advice
•• Read each question carefully before you start to answer it.
Try to answer every question.
• Check your answers if you have time at the end.
Turn over
P75677A
©2024 Pearson Education Ltd.
F:1/1/1/
*P75677A*
BLANK PAGE
2 P75677A
1.
4 6.5 7 1.3 2 5 1.5 6 4.5 6 1
The list of eleven numbers shown above is to be sorted into descending order.
(a) Carry out a quick sort to produce the sorted list. You should show the result of each
pass and identify the pivots clearly.
(3)
(b) Use the first‑fit decreasing bin packing algorithm to pack the numbers into bins of
size 10
(3)
(c) Determine whether your answer to part (b) uses the minimum number of bins. You
must justify your answer.
(2)
A different list of eleven numbers is to be sorted into descending order using a bubble
sort. The list after the second pass is
4.5 5.6 3.8 6.7 5.4 1.6 4.8 9.1 3.3 1.7 1.5
(d) Explain how you know that at least one of the first two passes of the bubble sort
was not carried out correctly.
(1)
(Total for Question 1 is 9 marks)
P75677A 3
Turn over
2. A company manages an awards evening.
The table below lists the activities required to set up the room for the evening, and their
immediately preceding activities. Each activity requires exactly one person.
A ‑
B A
C A
D C
E C
F B, D, E
G E
H B
J H, F, G
Figure 1 shows a partially completed activity network used to model the project. Each
activity is represented by an arc.
D
C
Figure 1
(a) Add the remaining five activities to Diagram 1 in the answer book to complete the
activity network, using exactly two dummies.
(3)
4 P75677A
In addition to setting up the room, the company must prepare the meals for the guests.
Figure 2 shows the activity network for preparing the main courses. The numbers in
brackets represent the time, in minutes, to complete each task.
M(18)
N(11)
L(17)
Q(12)
W(5) X(11)
P(9)
R(15)
S(7)
U(23)
Y(12)
T(12)
V(20)
Figure 2
(b) Complete Diagram 2 in the answer book to show the early event times and the late
event times for the activity network shown in Figure 2.
(3)
(c) State the critical activities.
(1)
(d) Given that the main courses need to be ready to be served (with all activities
completed) at 8 pm, state the latest time that activity R can start.
(1)
(Total for Question 2 is 8 marks)
P75677A 5
Turn over
3.
2
12 F K
13
B 6 y
5
2 C G
23
10 M
A 9
15 6
14
D 7 3
H
x
5
1
L
E 6 J
Figure 3
(b) (i) Use Dijkstra’s algorithm to find the shortest route from A to M.
(ii) State an expression for the length of the shortest route from A to M.
(6)
The warehouse manager wants to check that all of the walkways are in good condition.
Their inspection route starts at B and finishes at C.
The inspection route must traverse each walkway at least once and be as short
as possible.
(c) State the arcs that are traversed twice.
(1)
(d) State the number of times that H appears in the inspection route.
(1)
The warehouse manager finds that the total length of the inspection route is 172 metres.
(e) Determine the value of x and the value of y
(2)
(Total for Question 3 is 11 marks)
6 P75677A
4.
y
30
25
20
15
10
–5 0 5 10 15 20 25 30 x
Figure 4
Figure 4 shows three of the six constraints for a linear programming problem in x and y
The unshaded region and its boundaries satisfy these three constraints.
(a) State these three constraints as simplified inequalities with integer coefficients.
(3)
The variables x and y represent the number of orange fish and the number of blue fish,
respectively, that are to be kept in an aquarium.
The number of fish in the aquarium is subject to these three further constraints
• there must be at least one blue fish
• the orange fish must not outnumber the blue fish by more than ten
• there must be no more than five blue fish for every orange fish
(b) Write each of these three constraints as a simplified inequality with
integer coefficients.
(2)
P75677A 7
Turn over
(c) Represent these three constraints by adding lines and shading to Diagram 1 in the
answer book, labelling the feasible region, R
(3)
The total value (in pounds) of the fish in the aquarium is given by the objective function
Maximise P = 3x + 5y
(d) (i) Use the objective line method to determine the optimal point of the feasible
region, giving its coordinates as exact fractions.
(ii) Hence find the maximum total value of the fish in the aquarium, stating the
optimal number of orange fish and the optimal number of blue fish.
(4)
(Total for Question 4 is 12 marks)
8 P75677A