Edexcel D1 2006 June — Question 1 4 marks

Exam BoardEdexcel
ModuleD1 (Decision Mathematics 1)
Year2006
SessionJune
Marks4
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicSorting Algorithms
TypeBubble Sort Execution
DifficultyEasy -1.8 This is a purely mechanical application of the bubble sort algorithm with no problem-solving required. Students simply execute the standard procedure on a short list of 7 numbers, which is routine recall and application of a memorized algorithm with minimal computational complexity.
Spec7.03j Sorting: bubble sort and shuttle sort

52 48 50 45 64 47 53 The list of numbers above is to be sorted into descending order. Perform a bubble sort to obtain the sorted list, giving the state of the list after each completed pass. [4]

AnswerMarks Guidance
Bubble sort R → L: 52 48 50 45 64 47 53m1 No futile change - list sorted
Misread - sorting into ascending order (note: candidates reverse list full credit if gained)A1
L → R (ascending - misread): 52 48 50 45 64 47 53m1(B) No futile change - list sorted
R → L: 52 48 50 45 64 47 53m1(R) No futile change - list sorted
(4-2 for M/R)
Bubble sort R → L: 52 48 50 45 64 47 53 | m1 | No futile change - list sorted | A1 A1

Misread - sorting into ascending order (note: candidates reverse list full credit if gained) | A1

L → R (ascending - misread): 52 48 50 45 64 47 53 | m1(B) | No futile change - list sorted | A1 A1

R → L: 52 48 50 45 64 47 53 | m1(R) | No futile change - list sorted | A1

(4-2 for M/R)

---
52   48   50   45   64   47   53

The list of numbers above is to be sorted into descending order. Perform a bubble sort to obtain the sorted list, giving the state of the list after each completed pass.
[4]

\hfill \mbox{\textit{Edexcel D1 2006 Q1 [4]}}