# Recent questions tagged circular-queue

1 vote
1
$1)$How circular queue can be implemented? $2)$ For which data structure circular queue cannot be implemented? $(A)$Array $(B)$ Singly Linked List $(C)$ Doubly Linked List $(D)$ Stack
2
1 vote
3
The initial configuration of circular queue as follows What is status of states of queue contents after the following sequence of steps enqueue x dequeue enqueue y dequeue dequeue a)x,y,____,_____,_____ b)x,___,y,____,____ c)____,_____,x,y,____ d)_____,x,y,_____,_____
4
#DS I have this confusion in concluding the overflow condition of a circular Queue i.e. when the circular queue will be considered full. As per the text i have, it says a circular queue is full when: Front=0 and Rear=MAX-1 ; which seems quite straight forward. eg: The queue [10,5, ... is shouldn't the overflow condition of a circular Queue be: if((Front==0 && Rear==MAX-1) || (Rear==Front-1)) ???
1 vote
5
If $(rear==maxsize-1)$ $rear=0;$ else $rear=rear+1;$ is required in : circular queue linear queue stack deque
1 vote
6
a)a_cb_ b)_abc_ c)abc_ _ d)_ab_c