Computer scienceAlgorithms and Data StructuresData structuresLimited access data types

Circular queue

Remaining elements

Report a typo

Suppose you have a circular queue of the size 3. It rewrites the existing elements and always removes elements in the same order as they were added.

There is a sequence of operations to be performed:

enqueue 1
enqueue 3
dequeue
enqueue 2
enqueue 3

What items will remain in the queue starting with the first one to be removed?

Select one option from the list

1, 2, 3

2, 3, 1

3, 2, 3

3, 3, 1

___

Create a free account to access the full topic