Skip to content
Try on iPad

Queues: AQA A‑Level Computer Science questions

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

Find questions561
Calculations

561 questions

  1. Q02.1

    June 2024 · Paper 1

    2 marks4.2.2 Queues
    The whole paper ↗
    June 2024 Paper 1, question 02.1: Explain why, when implemented using a fixed-length array, a circular queue is usually considered to be a better choice of data structure than a linear queue. [2

  2. Q02.2

    June 2024 · Paper 1

    5 marks4.2.2 Queues
    The whole paper ↗
    June 2024 Paper 1, question 02.2: Describe the steps that must be completed to remove (dequeue) an item from a circular queue that has been implemented using a fixed-length array. [5 marks]

  3. Q01

    June 2023 · Paper 1

    5 marks4.2.2 Queues
    The whole paper ↗
    June 2023 Paper 1, question 01: Describe the process that should be followed to add an item to a circular queue implemented as a static data structure using an array. Your method should deal a

  4. Q02.1

    June 2022 · Paper 1

    4 marks4.2.2 Queues
    The whole paper ↗
    June 2022 Paper 1, question 02.1: Describe the method that would need to be followed to attempt to remove an item from a circular queue implemented as a static data structure using an array. You

  5. Q02.5

    June 2022 · Paper 1

    2 marks4.2.3 Stacks4.2.2 Queues
    The whole paper ↗
    June 2022 Paper 1, question 02.5: Explain how a single stack can be used to reverse the order of the items in a queue. [2 marks]

  6. Q04.2

    November 2020 · Paper 1

    3 marks4.2.2 Queues
    The whole paper ↗
    November 2020 Paper 1, question 04.2: Describe the steps involved in adding an item to a linear queue that has been implemented as a static data structure using an array. Your answer should include

  7. Q04.3

    November 2020 · Paper 1

    3 marks4.2.2 Queues
    The whole paper ↗
    November 2020 Paper 1, question 04.3: For a priority queue, the process to determine where a new item should be added is more complex than it is with a linear queue. Describe the steps involved when
All 7 questions on Queues, as a list
  1. June 2024, Paper 1, Q02.1 (2 marks): Explain why, when implemented using a fixed-length array, a circular queue is usually considered to be a better choice of data structure than a linear queue. [2
  2. June 2024, Paper 1, Q02.2 (5 marks): Describe the steps that must be completed to remove (dequeue) an item from a circular queue that has been implemented using a fixed-length array. [5 marks]
  3. June 2023, Paper 1, Q01 (5 marks): Describe the process that should be followed to add an item to a circular queue implemented as a static data structure using an array. Your method should deal a
  4. June 2022, Paper 1, Q02.1 (4 marks): Describe the method that would need to be followed to attempt to remove an item from a circular queue implemented as a static data structure using an array. You
  5. June 2022, Paper 1, Q02.5 (2 marks): Explain how a single stack can be used to reverse the order of the items in a queue. [2 marks]
  6. November 2020, Paper 1, Q04.2 (3 marks): Describe the steps involved in adding an item to a linear queue that has been implemented as a static data structure using an array. Your answer should include
  7. November 2020, Paper 1, Q04.3 (3 marks): For a priority queue, the process to determine where a new item should be added is more complex than it is with a linear queue. Describe the steps involved when

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.