The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged queues
0
votes
0
answers
1
Stack implementation by using queue
true/false ? ) if stack is implemented as a array,all operation push ,pop ,is emptystack(),delete stack() can be performed in constant time. )if stack is implemented as a linked list ,all operation ,is emptystack(),delete stack() can be performed in constant time.
asked
Jan 2
in
Programming
by
Gurdeep Saini
Loyal
(
7.8k
points)

55
views
datastructure
queues
stack
0
votes
0
answers
2
Gateforum Class Notes
The array implementation of Queue throws an error when the array limit has been reached. So we consider the following alternative. Create a larger array using redefine function. The cost of the redefine that makes the array larger is proportional to the new size. Suppose we expand the array ... $N$ insertions will take. $O(N^2)$ $O(N^3)$ $O(N)$ $O(log_2N)$ Answer provided: $A$
asked
Dec 23, 2018
in
DS
by
Gupta731
Active
(
4.3k
points)

56
views
datastructure
queues
0
votes
0
answers
3
Priority Queue
Is priority queue work efficiently with sorted array than unsorted array and heap for insertion and deletion operation? Then why do we apply priority queue in heap specially
asked
Dec 22, 2018
in
DS
by
srestha
Veteran
(
107k
points)

31
views
datastructure
priorityqueue
queues
0
votes
1
answer
4
GATEBOOK2019DS126
Which of the following option is not correct? If a queue is implemented with a linked list, keeping track of a front pointer, only rear pointer will change during an insertion into a nonempty queue. Queue data structure can be used to implement least recently ... be used to implement Quick sort algorithm but not least recently used (LRU) page fault algorithm. Both (A) and (C)
asked
Oct 27, 2018
in
Programming
by
GATEBOOK
Boss
(
13.9k
points)

67
views
gb2019ds1
queues
0
votes
1
answer
5
GATEBOOK2019DS128
Consider following pseudo code. void random_foo(int n) { Queue q; int i; enqueue(q,0); enqueue(q,1); for (i = 0; i < n; i++) { int a = dequeue(q); int b = dequeue(q); enqueue(q,b); enqueue(q,a + b); print(a); } } If q accepts ... $0$ to $n1$ prints numbers from $n1$ to $0$ prints first $n1$ Fibonacci numbers prints first $n$ Fibonacci numbers
asked
Oct 27, 2018
in
DS
by
GATEBOOK
Boss
(
13.9k
points)

28
views
gb2019ds1
queues
0
votes
1
answer
6
conceptual doubt
WHAT IS THE TIME COMPLEXITY TO ENQUEUE AN ELEMENT IF THE QUEUE IS IMPLEMENTED AS A CIRCULAR QUEUE AND WE HAVE GOT ONLY ONE POINTER TO FRONT ELEMENT??
asked
Sep 20, 2018
in
DS
by
sushmita
Boss
(
16.6k
points)

133
views
datastructure
linkedlists
timecomplexity
queues
0
votes
1
answer
7
Made easy
https://gateoverflow.in/?qa=blob&qa_blobid=11435838562783483664 Approach for Q9 please . (Please note: it is the last question on left hand side, and part of it is written on right hand side) Answer is d, but according to me it should be b as in 3 situation ... elements but won't be restored in it's original state as mentioned in question. So only 1 and 2 is possible. Is it correct?
asked
Jul 30, 2018
in
DS
by
manvi_agarwal
(
129
points)

67
views
madeeasybooklet
datastructure
queues
0
votes
1
answer
8
Self doubt
What are the minimum number of pointers required to implement a stack using single ended queue ( the queue is NOT a dequeue )?
asked
Jul 26, 2018
in
DS
by
kapilbk1996
(
459
points)

96
views
stack
queues
datastructure
pointers
0
votes
1
answer
9
Implement stack and queue using priority queue
On other sources, it is given that we need to assign high priorities to newly inserted element in case of stack otherwise low priority to newly inserted element in case of queue. My doubt here is that shouldn't ... heap priority queue and queue with minheap priority queue keeping above assumption of assigning priorities to newly inserted element?
asked
Jun 17, 2018
in
Algorithms
by
pallaviamu
(
229
points)

155
views
clrs
datastructure
stack
queues
priorityqueue
0
votes
0
answers
10
Implementation of Stack and Queue
In implementation of queue using stack, deletion of second element from front take Ο(n) time, when insertion take Ο(1) time. Is it a true statement ? Well it can be true isn't it ? because suppose elements come we simply push them without taking care of ... to stack1. dnQueue(q) 1) If stack1 is empty then error 2) Pop an item from stack1 and return it Am i right?
asked
May 5, 2018
in
Programming
by
Na462
Loyal
(
8.1k
points)

175
views
datastructure
queues
stack
0
votes
1
answer
11
GATE 2013
Its GATE 2013 question Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter. MultiDequeue(Q){ m = k while (Q is not empty) and (m > 0) { Dequeue(Q) m = m  1 } } What is the worst case time complexity of a ... performed on nonempty or full queue?? Due to this change will the answer remain same?? Θ(n) Θ(n + k) Θ(nk) Θ(n2)
asked
May 1, 2018
in
DS
by
!KARAN
Active
(
1.1k
points)

138
views
queues
0
votes
1
answer
12
#Test_Series
Consider implementation of stack using queue by following algorithm. Let $x$ be an element to be pushed in the stack push(q1,x) { EQ(q1,x) while(q1 does not contain 1 element) { k=DQ(q1) EQ(q1,k) } } pop(q1) { DQ(q1) } How many enqueue and dequeue operations required to push $2$ and pop $2$ elements in the empty stack?
asked
Apr 30, 2018
in
DS
by
himgta
Active
(
3.3k
points)

108
views
datastructure
stack
queues
0
votes
1
answer
13
Stack and queue
Hi please verify me We can implement a stack using only one queue. Like first insert into queue and for popping a element from stack dequeue n1 element from queue and enque into queue and then pop last element and do the same each time......try it and verify that I am right or wrong?
asked
Apr 7, 2018
in
Programming
by
Ravi prakash pandey
Junior
(
839
points)

178
views
datastructure
queues
stack
+12
votes
2
answers
14
GATE20183
A queue is implemented using a noncircular singly linked list. The queue has a head pointer and a tail pointer, as shown in the figure. Let $n$ denote the number of nodes in the queue. Let 'enqueue' be implemented by inserting a new node at the head, and 'dequeue' be implemented by deletion ... $\theta(1), \theta(1)$ $\theta(1), \theta(n)$ $\theta(n), \theta(1)$ $\theta(n), \theta(n)$
asked
Feb 14, 2018
in
DS
by
gatecse
Boss
(
18.3k
points)

2.8k
views
gate2018
algorithms
datastructure
queues
normal
linkedlists
0
votes
0
answers
15
Made Easy Mock 1
Consider the following statements: S1 : Implementation of stack using queue, deletion of second element from top of stack time complexity Ο(n), when insertion take Ο(1) time. S2 : In implementation of queue using stack, deletion of second element from front ... Ο(n) time. Both the statements are true. HOW? Kindly provide a detailed explanation. I am unable to solve such questions.
asked
Jan 31, 2018
in
DS
by
_jerry
(
353
points)

156
views
madeeasytestseries
datastructure
stack
queues
+1
vote
1
answer
16
ME  BASIC  4 Data Structures
Consider the following statements: S1: If stack is implemented as an array, all the operation push, pop, is_empty stack ( ), delete stack ( ) can be performed in constant time. S2: If stack is implemented as a linked list, all the ... structure. S4: Circular queues can be implemented with the help of the stack data structure. Which of the following option is false?
asked
Jan 23, 2018
in
DS
by
Rishabh Gupta 2
Boss
(
16k
points)

296
views
madeeasytestseries
datastructure
stack
queues
+2
votes
1
answer
17
Implementation of queue using stack
In implementation of queue using stack, deletion of second element from front take Ο(1) time, when insertion take Ο(n) time. Which of the following is correct ? True / False
asked
Jan 20, 2018
in
Algorithms
by
Hemant Parihar
Boss
(
15.9k
points)

320
views
datastructure
queues
stack
+1
vote
1
answer
18
Test series
Can someone explain the solution along with a picture of how the steps are taking place?
asked
Jan 20, 2018
in
DS
by
Kalpataru Bose
(
497
points)

100
views
madeeasytestseries
programminginc
queues
+1
vote
2
answers
19
Implementation of stack using queues
What are the minimum enqueue and dequeue operations needed to perform pop operation for a stack which is implemented with two queues if there are already 10 elements in the first queue?
asked
Jan 12, 2018
in
DS
by
Ibtisam Sayyad
(
17
points)

314
views
datastructure
stack
queues
+1
vote
0
answers
20
made easy test series
Consider the following statements: S1 : Implementation of stack using queue, deletion of second element from top of stack time complexity Ο(n), when insertion take Ο(1) time. S2 : In implementation of queue using stack, deletion of second element from front take Ο(1) time, when insertion take Ο(n) time. Which of the following is correct ?
asked
Jan 3, 2018
in
Programming
by
chandra sai
Active
(
1.3k
points)

213
views
stack
queues
datastructure
0
votes
0
answers
21
Queue
Consider the following statements: S1 : Implementation of stack using queue, deletion of second element from top of stack time complexity Ο(n), when insertion take Ο(1) time. S2 : In implementation of queue using stack, deletion of second element from front take Ο(1) time, when insertion take Ο(n) time. Why both statements are correct
asked
Dec 12, 2017
in
Programming
by
Shivi rao
Junior
(
795
points)

95
views
queues
datastructure
+2
votes
0
answers
22
Queues using stacks
PLEASE PROVIDE SOURCE FOR THIS CONCEPT Suppose that queue operations are implemented using stack operation. enqueue(x) and Dequeue( ) are queue operations whereas Pop( ) and Push(x) are stack operations. Consider the following code Enqueue(S1,x){ Push(S1,x); } Dequeue(S1,S2){ if(!IsEmptyStack S2) ... S2)); and S1; (C) Push (S1, Pop (S2)); and S2; (D) Push (S2, Pop (S1)); and S1;
asked
Nov 13, 2017
in
DS
by
Parshu gate
Active
(
5.1k
points)

230
views
queues
stack
datastructure
+1
vote
1
answer
23
stack operations using queue
Suppose Stack operations are implemented using Queue Operation. Push(x) and Pop() are stack operations whereas enqueue(x) and dequeue are Queue operations. Consider the code: pop() { return Q.dequeue(); } push(x) { n= Q.size(); //Q.size() returns the number of ... operation correctly (A) Q.enqueue(x) (B) Q.enqueue(Q.deqeue()) (C) Q.dequeue(Q.enqueue(x)) (D) Q.dequeue()
asked
Nov 12, 2017
in
DS
by
Parshu gate
Active
(
5.1k
points)

324
views
datastructure
stack
queues
priorityqueue
+4
votes
1
answer
24
QUEUE USING STACKS
Q.What will be time complexity of enqueue and dequeue operation when a queue is implemented using two stacks.
asked
Oct 31, 2017
in
DS
by
junaid ahmad
Loyal
(
9.4k
points)

704
views
datastructure
queues
stack
+1
vote
2
answers
25
Circular queue
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,_____,_____
asked
Oct 29, 2017
in
DS
by
srestha
Veteran
(
107k
points)

286
views
datastructure
circularqueue
queues
+2
votes
1
answer
26
Linked List
Which of the following operations is performed more efficiently by doubly linked list than by linear linked list? (a). Deleting a node whose location is given. (b). Searching an unsorted list of a given item. (c). inserting a node after the node with a given location. (d). Traversing the list to process each node.
asked
Oct 26, 2017
in
Programming
by
Shubham Kumar Gupta
Junior
(
675
points)

196
views
linkedlists
datastructure
programminginc
queues
0
votes
1
answer
27
Circular Queue
#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=MAX1 ; which seems quite straight forward. eg: The ... the overflow condition of a circular Queue be: if((Front==0 && Rear==MAX1)  (Rear==Front1)) ???
asked
Oct 24, 2017
in
Programming
by
nick17india
(
55
points)

266
views
queues
datastructure
circularqueue
+4
votes
2
answers
28
Queue implementaion using stack
A queue is implemented using 2 stacks. Minimum no. of stack operations (PUSH and POP) required for the sequence of 3 insertions and 2 delete operations in the queue is  .
asked
Oct 9, 2017
in
DS
by
SSrawat
(
113
points)

408
views
stack
queues
datastructure
+1
vote
0
answers
29
queue
A queue is implemented using two stack A and B. Consider the following code void enqueue(int value) { While (!B.is Empty()) A.push(B.Pop()); A. push (value); } int dequeue () { While (!A.is Empty()) {X} return B.Pop(); } if enqueue is implemented using two stacks A & B With ... )); B) B.Push(A.Pop()); C) A.Pop(B. Push ()); D) B.Pop(A. Push ()); what is difference between option b,d???
asked
Oct 1, 2017
in
DS
by
Hira Thakur
Boss
(
13.8k
points)

138
views
queues
0
votes
0
answers
30
Queue
If (rear==maxsize1) rear=0; else rear=rear+1; is required in circular queue or deque ?? I think it is circular queue but ans is deque...plzzz make me out..
asked
Sep 26, 2017
in
DS
by
rishu_darkshadow
Loyal
(
7.8k
points)

101
views
queues
Page:
1
2
next »
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
PSU's
Decidability Slides
AAI JE IT results out! Adv no 02/2018
Graph Theory Slides for GATECSE
Generating Function Useful Link
Follow @csegate
Gatecse
Recent questions tagged queues
Recent Blog Comments
love you sir and great work Subarna and...
18th jan was the last date
anyone from west bengal plss solve above query as...
in the home page of GO, the deadline for WBSEDCL...
47,111
questions
51,359
answers
177,879
comments
66,688
users