| Exam Board | Edexcel |
|---|---|
| Module | D1 (Decision Mathematics 1) |
| Year | 2006 |
| Session | January |
| Marks | 9 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Sorting Algorithms |
| Type | Algorithm Tracing |
| Difficulty | Easy -1.2 This is a straightforward trace-through exercise of a given flowchart algorithm. Students simply follow the flowchart step-by-step and record values in a table with specified precision. It requires careful execution but no problem-solving, conceptual understanding, or algorithmic design—purely mechanical application of given instructions. |
| Spec | 7.03a Algorithm definition: input, output, deterministic, finite7.03c Working with algorithms: trace, interpret, adapt |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| Output: 1, 1, 2, 3, 5 | M1 A1 |
| Answer | Marks | Guidance |
|--------|-------|----------|
| Output: 1, 1, 2, 3, 5 | M1 A1 | |\includegraphics{figure_3}
An algorithm is described by the flow chart shown in Figure 3.
\begin{enumerate}[label=(\alph*)]
\item Complete the table in the answer book recording the results of each step as the algorithm is applied.
(Notice that values of $A$, $B$, $C$ and $D$ are to be given to 3 decimal places, and the values of $E$ to 1 significant figure.) [8]
\item Write down the output from the algorithm. [1]
\end{enumerate}
\hfill \mbox{\textit{Edexcel D1 2006 Q3 [9]}}