A circular queue of capacity $N = 10$ is implemented using a 1D array with indices 0 to 9. The queue pointers $front\text{front}$ and $rear\text{rear}$ are defined as follows:

$front\text{front}$ points to the element currently at the front of the queue.
$rear\text{rear}$ points to the element currently at the rear of the queue.

When an item is dequeued, the item at $front\text{front}$ is removed, and then $front\text{front}$ is updated:

\text{front} = (\text{front} + 1) \pmod{10}

When an item is enqueued, $rear\text{rear}$ is first updated:

\text{rear} = (\text{rear} + 1) \pmod{10}

and the new item is then stored at this index.

Initially, the queue has $front=4\text{front} = 4$ and $rear=9\text{rear} = 9$ .

If two items are dequeued and then three items are enqueued, what are the new values of $front\text{front}$ and $rear\text{rear}$ ?

A circular queue of capacity $N = 10$ is implemented using a 1D array with indices 0 to 9. The queue pointers $front\text{front}$ and $rear\text{rear}$ are defined as follows:

$front\text{front}$ points to the element currently at the front of the queue.
$rear\text{rear}$ points to the element currently at the rear of the queue.

When an item is dequeued, the item at $front\text{front}$ is removed, and then $front\text{front}$ is updated:

\text{front} = (\text{front} + 1) \pmod{10}

When an item is enqueued, $rear\text{rear}$ is first updated:

\text{rear} = (\text{rear} + 1) \pmod{10}

and the new item is then stored at this index.

Initially, the queue has $front=4\text{front} = 4$ and $rear=9\text{rear} = 9$ .

If two items are dequeued and then three items are enqueued, what are the new values of $front\text{front}$ and $rear\text{rear}$ ?

Data structures

Question 5

Markscheme

Data structures

Question 5

Markscheme

Data structures

Question 5

Data structures Questions

Data structures

Question 5

Data structures Questions