Skip to content
Try on iPad

Graph-traversal: AQA A‑Level Computer Science questions

Every AQA A-Level Computer Science exam question on 4.3.1 Graph-traversal, 2020–2025, with its mark scheme and examiner’s report.

Find questions561
Calculations

561 questions

  1. Q03.4

    June 2025 · Paper 1

    1 mark4.3.1 Graph-traversal
    The whole paper ↗
    June 2025 Paper 1, question 03.4: Describe one of the base cases for the recursive subroutine Traverse. [1 mark] Figure 4 shows a trace table for the subroutine call Traverse(1, 6) The subroutin

  2. Q03.5

    June 2025 · Paper 1

    6 marks4.3.1 Graph-traversal
    The whole paper ↗
    June 2025 Paper 1, question 03.5: Complete the unshaded cells in Table 2 to show the result of tracing the algorithm shown in Figure 3 using the adjacency list AL in Figure 2 for the subroutine

  3. Q04.3

    June 2022 · Paper 1

    2 marks4.3.1 Graph-traversal
    The whole paper ↗
    June 2022 Paper 1, question 04.3: Complete the unshaded cells in Table 3 to show the result of the subroutine call F() when it is applied using the graph shown in Figure 6. Table 3 Count Value r

  4. Q04.5

    June 2022 · Paper 1

    6 marks4.3.1 Graph-traversal
    The whole paper ↗
    June 2022 Paper 1, question 04.5: Complete the unshaded cells in Table 5 to show the result of the subroutine call G(0, -1) on the graph shown in Figure 7. Some parts of the table, including the

  5. Q04.6

    June 2022 · Paper 1

    1 mark4.3.1 Graph-traversal
    The whole paper ↗
    June 2022 Paper 1, question 04.6: What is the purpose of the subroutine G? [1 mark]

  6. Q04.7

    June 2022 · Paper 1

    1 mark4.3.1 Graph-traversal
    The whole paper ↗
    June 2022 Paper 1, question 04.7: State the type of graph traversal used in subroutine G. [1 mark]
All 6 questions on Graph-traversal, as a list
  1. June 2025, Paper 1, Q03.4 (1 mark): Describe one of the base cases for the recursive subroutine Traverse. [1 mark] Figure 4 shows a trace table for the subroutine call Traverse(1, 6) The subroutin
  2. June 2025, Paper 1, Q03.5 (6 marks): Complete the unshaded cells in Table 2 to show the result of tracing the algorithm shown in Figure 3 using the adjacency list AL in Figure 2 for the subroutine
  3. June 2022, Paper 1, Q04.3 (2 marks): Complete the unshaded cells in Table 3 to show the result of the subroutine call F() when it is applied using the graph shown in Figure 6. Table 3 Count Value r
  4. June 2022, Paper 1, Q04.5 (6 marks): Complete the unshaded cells in Table 5 to show the result of the subroutine call G(0, -1) on the graph shown in Figure 7. Some parts of the table, including the
  5. June 2022, Paper 1, Q04.6 (1 mark): What is the purpose of the subroutine G? [1 mark]
  6. June 2022, Paper 1, Q04.7 (1 mark): State the type of graph traversal used in subroutine G. [1 mark]

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.