Register

queue basics

556 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Mutlitape and single...Next → · ace test
← Previous in category · BST(Test Series)Next in category → · max heap with binary...
Position:
Show:

Related questions

9 9 votes
2 2 answers
474
474 views
GO Classes asked Jul 27
474 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...
8 8 votes
2 2 answers
585
585 views
GO Classes asked Jul 27
585 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
216
216 views
GO Classes asked Jul 10
216 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 $...
8 8 votes
3 3 answers
346
346 views
GO Classes asked Jul 8
346 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...