Edexcel D1 (Decision Mathematics 1) 2022 January

0 \leqslant x & \leqslant 27

1. \(\begin{array} { l l l l l l l l l l } 17 & 9 & 15 & 8 & 20 & 13 & 28 & 4 & 12 & 5 \end{array}\) \section*{Question 1 continued} \section*{Question 1 continued} \section*{Question 1 continued}

2. \begin{figure}[h] \end{figure} \begin{figure}[h] \end{figure} \section*{Question 2 continued} \section*{D} \begin{verbatim} B $$\mathrm { A }$$ \end{verbatim} \begin{verbatim} \(\stackrel { \bullet } { \text { E } }\) \end{verbatim} \section*{Diagram 1} Weight of the minimum spanning tree: \(\_\_\_\_\)

3. \section*{Question 3 continued} Please redraw your activity network on this page if you need to do so.

4.
.
\section*{Question 4 continued} \section*{Grid 1}

5. \begin{figure}[h] \end{figure} [The total weight of the network is 82] \section*{Question 5 continued}

6. \section*{Question 6 continued} (b) \(\_\_\_\_\) (c) \section*{Question 6 continued}

7. \section*{Question 7 continued} \section*{Question 7 continued} \begin{figure}[h] \end{figure} \section*{Question 7 continued} \section*{Pearson Edexcel International Advanced Level} Time 1 hour 30 minutes \section*{Paper reference WDM11/01} \section*{Mathematics} \section*{You must have:} Decision Mathematics Answer Book (enclosed), calculator Candidates may use any calculator permitted by Pearson regulations. Calculators must not have the facility for symbolic algebra manipulation, differentiation and integration, or have retrievable mathematical formulae stored in them. \section*{Instructions}

• Use black ink or ball-point pen.
• If pencil is used for diagrams/sketches/graphs it must be dark (HB or B).
• Write your answers for this paper in the Decision Mathematics answer book provided.
• Fill in the boxes at the top of the answer book with your name, centre number and candidate number.
• Do not return the question paper with the answer book.
• Answer all questions and ensure that your answers to parts of questions are clearly labelled.
• Answer the questions in the spaces 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.
• Inexact answers should be given to three significant figures unless otherwise stated.

\section*{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.

\section*{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.
• If you change your mind about an answer, cross it out and put your new answer and any working underneath.

\section*{Write your answers in the D1 answer book for this paper.}

17 & 9 & 15 & 8 & 20 & 13 & 28 & 4 & 12 & 5 \end{array}$$ The numbers in the list shown above are the weights, in kilograms, of ten boxes. The boxes are to be transported in containers that will each hold a maximum weight of 40 kilograms.

1. Calculate a lower bound for the number of containers that will be needed to transport the boxes. You must show your working.
2. Use the first-fit bin packing algorithm to allocate the boxes to the containers.
3. Using the list provided, carry out a quick sort to produce a list of the weights in ascending order. You must make your pivots clear.
4. Use the binary search algorithm to try to locate the weight of 9 in the sorted list. Clearly indicate how you choose your pivots and which part of the list is being rejected at each stage.