| Exam Board | Edexcel |
|---|---|
| Module | D1 (Decision Mathematics 1) |
| Year | 2021 |
| Session | October |
| Marks | 10 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Sorting Algorithms |
| Type | Bin Capacity Constraints |
| Difficulty | Moderate -0.8 This is a straightforward bin-packing question requiring application of standard algorithms (likely first-fit or first-fit decreasing). It involves simple arithmetic and following a mechanical procedure with no problem-solving insight needed. Decision Maths D1 questions are typically more procedural than conceptual, making this easier than average A-level content. |
| Spec | 7.03l Bin packing: next-fit, first-fit, first-fit decreasing, full bin |
7. The numbers listed below are to be packed into bins of size $n$, where $n$ is a positive integer.\\
14\\
20\\
23\\
17\\
15\\
22\\
19\\
25\\
\hfill \mbox{\textit{Edexcel D1 2021 Q7 [10]}}