| Exam Board | Edexcel |
|---|---|
| Module | D1 (Decision Mathematics 1) |
| Year | 2004 |
| Session | June |
| Marks | 9 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Sorting Algorithms |
| Type | Binary Search Execution |
| Difficulty | Easy -1.8 This is a highly routine D1 question testing basic recall of binary search prerequisites and mechanical application of bubble/quick sort and binary search algorithms. Part (a) requires only stating 'the list must be sorted' (1 mark of pure recall), part (b) is straightforward application of a standard sorting algorithm with no problem-solving, and part (c) is mechanical execution of binary search. No mathematical insight or novel thinking required—purely algorithmic bookwork. |
| Spec | 7.03j Sorting: bubble sort and shuttle sort |
\begin{enumerate}
\item Glasgow
\item Newcastle
\item Manchester
\item York
\item Leicester
\item Birmingham
\item Cardiff
\item Exeter
\item Southampton
\item Plymouth
\end{enumerate}
A binary search is to be performed on the names in the list above to locate the name Newcastle.
\begin{enumerate}[label=(\alph*)]
\item Explain why a binary search cannot be performed with the list in its present form. [1]
\item Using an appropriate algorithm, alter the list so that a binary search can be performed. State the name of the algorithm you use. [4]
\item Use the binary search algorithm on your new list to locate the name Newcastle. [4]
\end{enumerate}
\hfill \mbox{\textit{Edexcel D1 2004 Q4 [9]}}