| Exam Board | Edexcel |
|---|---|
| Module | D1 (Decision Mathematics 1) |
| Year | 2014 |
| Session | June |
| Marks | 11 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Sorting Algorithms |
| Type | Quick Sort Execution |
| Difficulty | Easy -1.2 This is a straightforward algorithmic execution question requiring mechanical application of standard D1 algorithms (first-fit, quick sort, first-fit decreasing) with no problem-solving or insight needed. The procedures are routine and well-practiced, making this easier than average A-level maths questions which typically require some conceptual understanding or multi-step reasoning. |
| Spec | 7.03k Sorting: quick sort7.03l Bin packing: next-fit, first-fit, first-fit decreasing, full bin |
1.
$$\begin{array} { l l l l l l l l l }
31 & 10 & 38 & 45 & 19 & 47 & 35 & 28 & 12
\end{array}$$
\begin{enumerate}[label=(\alph*)]
\item Use the first-fit bin packing algorithm to determine how the numbers listed above can be packed into bins of size 60
\item Carry out a quick sort to produce a list of the numbers in descending order. You should show the result of each pass and identify your pivots clearly.
\item Use the first-fit decreasing bin packing algorithm to determine how the numbers listed can be packed into bins of size 60
\item Determine whether the number of bins used in (c) is optimal. Give a reason for your answer.
\end{enumerate}
\hfill \mbox{\textit{Edexcel D1 2014 Q1 [11]}}