Register

Queue

302 views
0 0 votes
If we keep the initial value of rear and front as zero in the circular queue then is it true that no dequeue or enqueue operation will be  at zeroth index

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Operator GrammarNext → · Basic page table que...
← Previous in category · QueueNext in category → · 4-way -tree
Position:
Show:

Related questions

9 9 votes
2 2 answers
357
357 views
GO Classes asked Jul 27
357 views
GO Classes DPP | GATE CS, DA | Data Structure | Stack and Queue Transfer
Given a stack $S$ with $5$ elements from top to bottom as:$2, 4, 6, 8, 10$and an empty queue $Q$.First, remove the elements one by one from $S$ and insert them into $Q$.T...
7 7 votes
1 1 answer
400
400 views
GO Classes asked Jul 27
400 views
GO Classes DPP | GATE CS, DA | Data Structure | Stack & Queue
Which of the following statements are true?$\text{S1.}$ Stack operations $\texttt{push}$, $\texttt{pop}$, and $\texttt{isEmpty}$ can be worst-case $O(1)$ for a linked-lis...
4 4 votes
1 1 answer
174
174 views
GO Classes asked Jul 10
174 views
GO Classes DPP | GATE CS, DA | Data Structure | Queue Order
Suppose a client performs an intermixed sequence of $\texttt{enqueue}$ and $\texttt{dequeue}$ operations on a queue. The enqueue operations put the integers $0$ through $...
7 7 votes
3 3 answers
294
294 views
GO Classes asked Jul 8
294 views
GO Classes DPP | GATE CS | Data Structures | Queue Using Stacks
A queue is implemented using two stacks $\text{S1}$ and $\text{S2}$.Use the implementation where $\texttt{dequeue()}$ is $\text{O(1)}$ by keeping the front of the queue a...