100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
Previously searched by you
Pearson Edexcel International Advanced Level Mathematics International Advanced Subsidiary/Advanced Level Decision Mathematics D1 QP MAY 2024$12.99
Add to cart
Pearson Edexcel International Advanced Level Mathematics International Advanced Subsidiary/Advanced Level Decision Mathematics D1
QP MAY 2024
Pearson Edexcel International Advanced Level
Thursday 16 May 2024
Afternoon (Time: 1 hour 30 minutes)
Paper
reference WDM11/01
Mathematics
🞍 🞍
International Advanced Subsidiary/Advanced Level
Decision Mathematics D1
You must have:
Decision Mathematics Answer Book (enclosed), calculator
Candidates may use any calculator allowed by Pearson regulations.
Calculators must not have the facility for symbolic algebra manipulation,
differentiation and integration, or have retrievable mathematical formulae
stored in them.
Instructions
•• Use black ink or ball-point pen.
If pencil is used for diagrams/sketches/graphs it must be dark (HB or B).
Coloured pencils and highlighter pens must not be used.
• Fill in the boxes on the top of the answer book with your name, centre number
and candidate number.
• Answer all questions and ensure that your answers to parts of questions are
clearly labelled.
• Answer the questions in the D1 answer book provided
– there may be more space than you need.
• You should show sufficient working to make your methods clear.
Answers without working may not gain full credit.
• When a calculator is used, the answer should be given to an appropriate degree
of accuracy.
• Do not return the question paper with the answer book.
Information
•• There are 7 questions in this question paper. The total mark for this paper is 75.
The marks for each question are shown in brackets
– use this as a guide as to how much time to spend on each question.
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
, Write your answers in the D1 answer book for this paper.
1.
5.2 4.7 6.5 4.5 3.1 5.1 1.8 2.9 3.4 3.8 1.2
(a) Use the first‑fit bin packing algorithm to determine how the eleven numbers listed
above can be packed into bins of size 14
(3)
(b) The list of numbers is to be sorted into ascending order. Use a quick sort to
obtain the sorted list. You should show the result of each pass and identify your
pivots clearly.
(4)
(c) Apply the first‑fit decreasing bin packing algorithm to the sorted list to pack the
numbers into bins of size 14
(3)
(d) Explain why the number of bins used in part (c) is optimal.
(1)
(e) Use the binary search algorithm to try to locate 3.0 in the list of numbers.
Clearly indicate how you choose your pivots and which part of the list is rejected at
each stage.
(3)
(Total for Question 1 is 14 marks)
2 P74306A
🞍🞍🞍🞍
,2.
G(2)
D(4)
H(4) L(3)
F(3)
E(3)
A(5) I(6) M(2)
B(4)
J(7)
N(2)
C(7)
K(7)
Figure 1
[The sum of the durations of all the activities is 59 days.]
The network in Figure 1 shows the activities that need to be undertaken to complete
a project. Each activity is represented by an arc and the duration, in days, of the
corresponding activity is shown in brackets. Each activity requires one worker.
The project is to be completed in the shortest possible time.
(a) (i) Complete Diagram 1 in the answer book to show the early event times and the
late event times.
(ii) State the minimum completion time of the project.
(5)
(b) Calculate a lower bound for the number of workers needed to complete the project
in the minimum time. You must show your working.
(1)
(c) Schedule the activities using the minimum number of workers so that the project is
completed in the minimum time.
(4)
(Total for Question 2 is 10 marks)
P74306A 3
🞍🞍🞍🞍 Turn over
, 3.
C 61 E 9 H
18
10 40 7
13
A 52 30
D J
38 51
27 8
20
59
B 34 13
9
F 5 G
Figure 2
Figure 2 models a network of tracks between nine ranger stations,
A, B, C, D, E, F, G, H and J, in a forest. The number on each edge gives the time, in
minutes, to travel along the corresponding track. The forest ranger wishes to travel from
A to J as quickly as possible.
(a) Use Dijkstra’s algorithm to find the shortest time needed to travel from A to J.
State the quickest route.
(6)
(b) Hence determine the weight of the minimum spanning tree for the network given in
Figure 2. Give a reason for your answer.
You do not need to find the minimum spanning tree.
(2)
(Total for Question 3 is 8 marks)
4 P74306A
🞍🞍🞍🞍
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller papersbybree. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $12.99. You're not tied to anything after your purchase.
