Skip to content
Try on iPad

Writing functional programs: AQA A‑Level Computer Science questions

Every AQA A-Level Computer Science exam question on 4.12.2 Writing functional programs, 2020–2025, with its mark scheme and examiner’s report.

Find questions561
Calculations

561 questions

  1. Q11.3

    June 2025 · Paper 2

    2 marks4.12.2 Writing functional programs
    The whole paper ↗
    June 2025 Paper 2, question 11.3: Explain why the recursive method used by the code in Figure 6 is not an efficient method of calculating the nth term in the Fibonacci sequence. [2 marks]

  2. Q12.1

    June 2022 · Paper 2

    1 mark4.12.2 Writing functional programs
    The whole paper ↗
    June 2022 Paper 2, question 12.1: Shade one lozenge to indicate which of the listed functions from Figure 8 includes a higher-order function in its definition. [1 mark] fu fv fx fy

  3. Q12.2

    June 2022 · Paper 2

    1 mark4.12.2 Writing functional programs
    The whole paper ↗
    June 2022 Paper 2, question 12.2: Shade two lozenges to indicate which of the listed functions from Figure 8 use recursion in their definitions. [1 mark] fu fv fw fx

  4. Q12.3

    June 2022 · Paper 2

    4 marks4.12.2 Writing functional programs
    The whole paper ↗
    June 2022 Paper 2, question 12.3: Calculate the results of making the function calls listed in Table 2, using the functions and list in Figure 8 as appropriate. [4 marks] Table 2 Function call R

  5. Q12.4

    June 2022 · Paper 2

    1 mark4.12.2 Writing functional programs
    The whole paper ↗
    June 2022 Paper 2, question 12.4: Explain the purpose of the function fz. [1 mark]

  6. Q12.5

    June 2022 · Paper 2

    1 mark4.12.2 Writing functional programs
    The whole paper ↗
    June 2022 Paper 2, question 12.5: It is proposed that the definition of the function fz is changed to: fz d = fu (fy (d)) Explain why this new definition of fz could be considered to be an impro

  7. Q11.3

    November 2020 · Paper 2

    2 marks4.12.2 Writing functional programs
    The whole paper ↗
    November 2020 Paper 2, question 11.3: Explain what a higher-order function is. [2 marks]

  8. Q11.4

    November 2020 · Paper 2

    1 mark4.12.2 Writing functional programs
    The whole paper ↗
    November 2020 Paper 2, question 11.4: What is the result of this application of the fold function? fold (*) 1 [2, 3, 2] [1 mark] Result
All 8 questions on Writing functional programs, as a list
  1. June 2025, Paper 2, Q11.3 (2 marks): Explain why the recursive method used by the code in Figure 6 is not an efficient method of calculating the nth term in the Fibonacci sequence. [2 marks]
  2. June 2022, Paper 2, Q12.1 (1 mark): Shade one lozenge to indicate which of the listed functions from Figure 8 includes a higher-order function in its definition. [1 mark] fu fv fx fy
  3. June 2022, Paper 2, Q12.2 (1 mark): Shade two lozenges to indicate which of the listed functions from Figure 8 use recursion in their definitions. [1 mark] fu fv fw fx
  4. June 2022, Paper 2, Q12.3 (4 marks): Calculate the results of making the function calls listed in Table 2, using the functions and list in Figure 8 as appropriate. [4 marks] Table 2 Function call R
  5. June 2022, Paper 2, Q12.4 (1 mark): Explain the purpose of the function fz. [1 mark]
  6. June 2022, Paper 2, Q12.5 (1 mark): It is proposed that the definition of the function fz is changed to: fz d = fu (fy (d)) Explain why this new definition of fz could be considered to be an impro
  7. November 2020, Paper 2, Q11.3 (2 marks): Explain what a higher-order function is. [2 marks]
  8. November 2020, Paper 2, Q11.4 (1 mark): What is the result of this application of the fold function? fold (*) 1 [2, 3, 2] [1 mark] Result

Questions, mark schemes and examiner’s reports are © AQA, from their published past papers. Plumi isn’t affiliated with any exam board. Want whole papers? Full past papers.

Rather write your answers by hand on iPad? Plumi marks them against the same mark schemes.