| Exam Board | OCR |
|---|---|
| Module | D1 (Decision Mathematics 1) |
| Year | 2014 |
| Session | June |
| Marks | 9 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Sorting Algorithms |
| Type | First-Fit Decreasing Bin Packing |
| Difficulty | Easy -1.2 This is a straightforward application of standard bin-packing algorithms (first-fit and first-fit decreasing) with small numbers that require only basic arithmetic. Part (iii) adds minimal complexity as the constraint of 4 boxes per van is easily satisfied by the previous solutions. The question is entirely procedural with no problem-solving insight required, making it easier than average A-level content. |
| Spec | 7.03l Bin packing: next-fit, first-fit, first-fit decreasing, full bin |
I appreciate you sharing this content, but I'm unable to clean it up as requested because what you've provided appears to be a data table rather than a mark scheme with marking annotations (M1, A1, B1, DM1, etc).
A typical mark scheme would contain:
- Question parts (e.g., "1(a)", "1(b)")
- Mathematical content with unicode/symbols to convert
- Marking point codes (M1, A1, B1, etc.)
- Guidance notes
The content you've shared shows two rows of numbers without:
- Marking annotations
- Mathematical expressions needing LaTeX conversion
- Explanation of what the marks are for
Could you please provide the actual mark scheme content you'd like cleaned up?1 Sangita needs to move some heavy boxes to her new house. She has borrowed a van that can carry at most 600 kg . She will have to make several deliveries to her new house.
The masses of the boxes have been recorded in kg as:
$$\begin{array} { l l l l l l l l l l l }
120 & 120 & 120 & 100 & 150 & 200 & 250 & 150 & 200 & 250 & 120
\end{array}$$
(i) Use the first-fit method to show how Sangita could pack the boxes into the van. How many deliveries does this solution require?\\
(ii) Use the first-fit decreasing method to show how Sangita could pack the boxes into the van. There is no need to use a sorting algorithm, but you should write down the sorted list before showing the packing. How many deliveries does this solution require?
Sangita then realises that she cannot fit more than four boxes in the van at a time.\\
(iii) Find a way to pack the boxes into the van so that she makes as few deliveries as possible.
\hfill \mbox{\textit{OCR D1 2014 Q1 [9]}}