| Exam Board | OCR |
|---|---|
| Module | FD1 AS (Further Decision 1 AS) |
| Year | 2017 |
| Session | December |
| Marks | 4 |
| Topic | Sorting Algorithms |
| Type | Algorithm Tracing |
| Difficulty | Moderate -0.8 This is a straightforward algorithm tracing exercise requiring students to follow a flowchart step-by-step with a given input and record variable changes. Part (ii) asks for a simple explanation of termination. While it requires careful attention to detail, it involves no problem-solving or mathematical insight—just mechanical execution of an algorithm, which is typical but below-average difficulty even for Decision Mathematics. |
| Spec | 7.03c Working with algorithms: trace, interpret, adapt |
1\\
\includegraphics[max width=\textwidth, alt={}, center]{a7bca340-6947-42b5-bc35-e6d429d6bed7-2_953_559_347_753}\\
(i) Trace through the flowchart above using the input $N = 97531$. You only need to record values when they change.\\
(ii) Explain why the process in the flowchart is finite.
\hfill \mbox{\textit{OCR FD1 AS 2017 Q1 [4]}}