Skip to content
Android waitlistTry on iPad
Get started

Algorithms and complexity: OCR A‑Level Further Maths questions

OCR A-Level Further Maths past-paper questions on 1.1 Algorithms and complexity, 2018–2025, with mark schemes and examiner’s reports where available. Add MadAsMaths questions to your practice, or browse them separately by topic and difficulty.

Questions from
Paper
All papers
Exam
All years

648 questions

  1. Q1

    June 2025 · AS Discrete Mathematics

    The whole paper ↗

    Loading the question…

    Open the full PDF
  2. Q7

    June 2024 · AS Discrete Mathematics

    The whole paper ↗

    Loading the question…

    Open the full PDF
  3. Q5

    June 2023 · Discrete Mathematics

    The whole paper ↗

    Loading the question…

    Open the full PDF
  4. Q3

    June 2023 · AS Discrete Mathematics

    The whole paper ↗

    Loading the question…

    Open the full PDF
  5. Q4

    June 2022 · Discrete Mathematics

    The whole paper ↗

    Loading the question…

    Open the full PDF
  6. Q7

    June 2022 · Discrete Mathematics

    The whole paper ↗

    Loading the question…

    Open the full PDF
  7. Q1

    June 2022 · AS Discrete Mathematics

    The whole paper ↗

    Loading the question…

    Open the full PDF
  8. Q3

    June 2022 · AS Discrete Mathematics

    The whole paper ↗

    Loading the question…

    Open the full PDF
  9. Q4

    November 2021 · Discrete Mathematics

    The whole paper ↗

    Loading the question…

    Open the full PDF
  10. Q1

    November 2020 · AS Discrete Mathematics

    The whole paper ↗

    Loading the question…

    Open the full PDF
  11. Q4

    June 2019 · Discrete Mathematics

    The whole paper ↗

    Loading the question…

    Open the full PDF
  12. Q3

    June 2019 · AS Discrete Mathematics

    The whole paper ↗

    Loading the question…

    Open the full PDF
All 12 questions on Algorithms and complexity, as a list
  1. June 2025, AS Discrete Mathematics, Q1 (6 marks): A builder has some pieces of wood that are 6 m in length. The builder needs to cut smaller pieces to use in a project. The lengths of the smaller pieces require
  2. June 2024, AS Discrete Mathematics, Q7 (13 marks): Six items need to be packed into bins. Each bin has size k, where k is an integer. The sizes of the items are 8 5 4 7 3 3 (a) Show a way to pack the items into
  3. June 2023, Discrete Mathematics, Q5 (12 marks): A list of 8 values is given below. 3 24 8 1 4 20 30 18 The list is to be sorted into increasing order using quick sort, as given in the Formulae Booklet. (a) Ca
  4. June 2023, AS Discrete Mathematics, Q3 (12 marks): The list of numbers below is to be sorted into increasing order. 23 10 18 7 62 54 31 82 (a) Sort the list using bubble sort. You do not need to show intermediat
  5. June 2022, Discrete Mathematics, Q4 (13 marks): A connected graph is shown below. D G A F C B E H (a) Write down a path through exactly 7 of the vertices. [1] (b) Write down a cycle through exactly 6 of the v
  6. June 2022, Discrete Mathematics, Q7 (12 marks): A building has 7 CCTV cameras, A to G, at the junctions of some of the corridors. The cameras at the junctions and the lengths of the 11 corridors between them,
  7. June 2022, AS Discrete Mathematics, Q1 (4 marks): The flowchart below has positive inputs X, Y and M. Input X, Y N = 0 Input a positive integer M H = 1 ÷ M D = (X2 + Y2) ÷ (5X) X = X + H Y = Y + H×D N = N + 1 Y
  8. June 2022, AS Discrete Mathematics, Q3 (10 marks): (a) The list below is to be sorted into increasing order using bubble sort. 52 38 15 61 27 49 10 33 96 74 (i) Determine the list that results at the end of the
  9. November 2021, Discrete Mathematics, Q4 (13 marks): One of these graphs is isomorphic to K2,3. Graph A Graph B Graph C (a) Explain how you know that each of the other graphs is not isomorphic to K2,3. [2] The arc
  10. November 2020, AS Discrete Mathematics, Q1 (10 marks): Algorithm X is given below: STEP 1: Let A = 0 STEP 2: Input the value of B [B must be a positive integer] C = INT(B ÷ 3) STEP 3: STEP 4: D = B + 3C STEP 5: Repl
  11. June 2019, Discrete Mathematics, Q4 (12 marks): An algorithm must have an input, an output, be deterministic and finite. (a) Why is a counter sometimes used in an algorithm? [1] A computer takes 0.2 seconds t
  12. June 2019, AS Discrete Mathematics, Q3 (11 marks): (a) Give an example of a standard sorting algorithm that can be used when some of the values are not known until after the sorting has been started. [1] Becky n

Questions, mark schemes and examiner’s reports are © OCR, from their published past papers. Plumi isn’t affiliated with any exam board. Want whole papers? OCR A-Level Further Maths past papers.

The Plumi iPad app also offers exam-style questions with AI feedback on your handwritten working.