Login or Create an Account to view the mark scheme, comment, and add to a test
(a).
Consider the array implementation of a circular queue illustrated below. Each element in the queue is characterised by both an index and value, indicating the underlying array index and element value respectively.
Question Image
(i).
By manipulating the circular queue represented above, draw the result of enqueuing letters "C", "A" & "T" (in their provided written order from left to right i.e. x3 separate enqueue operations) followed by one dequeue operation.
[2]
(ii).
Given an array implementation of the circular queue above, state the condition upon which it would be identified as FULL.
[2]
(b).
Describe the key functionality of a circular queue.
[3]
(c).
Compare and contrast circular queues with linear queues.
[4]

Extended Response11 MarksPremium
29 Uses72 Views2 Likes