AQA A-LEVEL COMPUTER SCIENCE PAPER
1 STUDY GUIDE EXAM 2026 COMPLETE
QUESTIONS WITH SOLUTIONS GRADED A+
◉what is a queue? Answer: an abstract data structure based on an
array. A FIFO (first in first out) abstract data type.
◉an example of where queues are used in computer systems?
Answer: keyboard buffers, each key press is added to the queue.
◉which search algorithm uses a queue to keep track of which nodes
have been visited? Answer: breadth first.
◉what abstract data structure does a breadth first search algorithm
use to keep track of which nodes have been visited? Answer: A
queue
◉how many pointers does a linear queue have? Answer: 2
◉where are the pointers located in a linear queue? Answer: front
and rear of the queue.
,◉what operation adds a value into a queue? Answer: enqueue
◉what operation removes a value into a queue? Answer: dequeue
◉when a value is enqueued into a queue where is it entered?
Answer: at the rear.
◉when a value is dequeued from a queue where is it removed from?
Answer: the front.
◉what are the 4 operations that can be performed to a queue?
Answer: enqueue
dequeue
isfull
isempty
◉if a queue has no content what does the operation isfull return for
that queue? Answer: false
◉if a queue has no content what does the operation isempty return
for that queue? Answer: true
, ◉if a queue has no available positions behind the front pointer what
does the operation isfull return for that queue? Answer: true
◉if a queue has available positions behind the front pointer what
does the operation isfull return for that queue? Answer: false
◉how is emptiness detected in a queue? Answer: if the front and
rear pointer are at the same position the queue is empty.
◉what is an advantage to a circular queue? Answer: more memory
efficient.
◉what is the difference between circular and linear queues?
Answer: in a circular queue the front and rear pointers can move
over the two ends of the queue.
◉how does a priority queue work? Answer: items are assigned a
priority, items with the highest priority are dequeued first.
◉what happens if 2 items have the same priority? Answer: items
are dequeued in the first in first out takes order.
1 STUDY GUIDE EXAM 2026 COMPLETE
QUESTIONS WITH SOLUTIONS GRADED A+
◉what is a queue? Answer: an abstract data structure based on an
array. A FIFO (first in first out) abstract data type.
◉an example of where queues are used in computer systems?
Answer: keyboard buffers, each key press is added to the queue.
◉which search algorithm uses a queue to keep track of which nodes
have been visited? Answer: breadth first.
◉what abstract data structure does a breadth first search algorithm
use to keep track of which nodes have been visited? Answer: A
queue
◉how many pointers does a linear queue have? Answer: 2
◉where are the pointers located in a linear queue? Answer: front
and rear of the queue.
,◉what operation adds a value into a queue? Answer: enqueue
◉what operation removes a value into a queue? Answer: dequeue
◉when a value is enqueued into a queue where is it entered?
Answer: at the rear.
◉when a value is dequeued from a queue where is it removed from?
Answer: the front.
◉what are the 4 operations that can be performed to a queue?
Answer: enqueue
dequeue
isfull
isempty
◉if a queue has no content what does the operation isfull return for
that queue? Answer: false
◉if a queue has no content what does the operation isempty return
for that queue? Answer: true
, ◉if a queue has no available positions behind the front pointer what
does the operation isfull return for that queue? Answer: true
◉if a queue has available positions behind the front pointer what
does the operation isfull return for that queue? Answer: false
◉how is emptiness detected in a queue? Answer: if the front and
rear pointer are at the same position the queue is empty.
◉what is an advantage to a circular queue? Answer: more memory
efficient.
◉what is the difference between circular and linear queues?
Answer: in a circular queue the front and rear pointers can move
over the two ends of the queue.
◉how does a priority queue work? Answer: items are assigned a
priority, items with the highest priority are dequeued first.
◉what happens if 2 items have the same priority? Answer: items
are dequeued in the first in first out takes order.
