4.2.2.1 Linear, circular and priority queues Quiz: AQA Computer Science, Unit 2

The 20 questions

1. Which data structure operates on a First-In, First-Out (FIFO) basis?

   • Graph
   • Tree
   • Stack
   • Queue

2. Which data processing order describes the behaviour of a linear queue?

   • First-in, first-out
   • Last-in, first-out
   • Random order
   • Highest-value first

3. Which operation is used to add a new item to the rear of a queue?

   • Push
   • Pop
   • Enqueue
   • Dequeue

4. Which test must be performed before attempting to remove an item from a queue?

   • Test for overflow
   • Test for full
   • Test for empty
   • Test for null

5. A linear queue has a fixed-size array of 5 places. How many items can it hold at most?

   • 4
   • 5
   • 6
   • 10

6. What condition occurs if an item is added to a completely full queue?

   • Null pointer error
   • Overflow error
   • Underflow error
   • Syntax error

7. What main limitation affects a static array-based linear queue as items are added and removed?

   • Data corruption
   • Infinite looping
   • Unusable empty space
   • Stack overflow

8. How does a circular queue reuse freed space at the start of an array?

   • Wraps pointers around
   • Clears the array
   • Resizes the array
   • Shifts all items

9. Which item is dequeued first from a priority queue?

   • Last inserted item
   • First inserted item
   • Highest priority item
   • Smallest data size

10. Items A, B and C are added to a standard queue in that order. Which item is removed first?

    • A
    • C
    • B
    • None

11. What term describes the error caused by attempting to remove an item from an empty queue?

    • Buffer overflow
    • Queue overflow
    • Queue underflow
    • Stack overflow

12. In a circular queue of size 8, if front is 6 and 5 items are added, where is rear?

    • Index 7
    • Index 2
    • Index 5
    • Index 6

13. In what order does a standard print queue process incoming document jobs?

    • Largest file first
    • Order of arrival
    • Reverse arrival order
    • Smallest file first

14. Which data structure is most commonly used with front and rear pointers to implement a queue?

    • Array
    • Hash table
    • Binary tree
    • Graph

15. In a hospital emergency room queue, what determines the position of each patient?

    • Urgency level
    • Arrival time
    • Alphabetical name
    • Age order

16. What error occurs when attempting to add an item to a full linear queue?

    • Underflow
    • Syntax error
    • Overflow
    • Type error

17. What terms describe the access orders of a queue and a stack respectively?

    • LILO and LIFO
    • FIFO and LIFO
    • LIFO and FIFO
    • FIFO and FILO

18. How is a circular queue checked to determine whether it is completely full?

    • Check item count
    • Check front pointer
    • Check rear pointer
    • Check top pointer

19. When a server uses a standard linear queue for task scheduling, in what order are tasks processed?

    • Reverse arrival order
    • Priority order
    • Random order
    • Arrival order

20. Which pointer is incremented when an item is removed from a linear queue?

    • Front pointer
    • Top pointer
    • Base pointer
    • Rear pointer

Related quizzes

• Data structures and abstract data types Quiz · 4.2.1.1 · 20 questions
• Single- and multi-dimensional arrays Quiz · 4.2.1.2 · 20 questions
• Reading and writing text and binary files Quiz · 4.2.1.3 · 20 questions
• Stack operations Quiz · 4.2.3.1 · 20 questions
• Graphs: weighted, directed and adjacency representations Quiz · 4.2.4.1 · 20 questions
• Trees and binary trees Quiz · 4.2.5.1 · 20 questions
• Hash tables, hashing and collisions Quiz · 4.2.6.1 · 20 questions
• Dictionaries and key-value pairs Quiz · 4.2.7.1 · 20 questions
• Vectors and vector operations Quiz · 4.2.8.1 · 20 questions
• Data types Quiz · 4.1.1.1 · 20 questions