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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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.
Recent questions tagged queues
0
votes
0
answers
1
#delay #computer networks
Assume $5$ packets arrive in a burst to a router at time $t=0$ seconds, and another burst of packets arrive at $t=10s$, and so on every $10$ seconds; and if one packet departs from the router at $t=1s, t=2s, ... $and so on. What is the maximum number of packets in the router buffer? #delay #packetswitiching #queueingmodel #playbackbuffer
asked
5 days
ago
in
Computer Networks
by
ਮਾਧਵ ਨੰਦਨ
(
163
points)

27
views
computernetworks
queues
queueingmodel
buffer
delay
0
votes
0
answers
2
end to end delay numerical Any help appreciated.
asked
6 days
ago
in
Computer Networks
by
ਮਾਧਵ ਨੰਦਨ
(
163
points)

35
views
computernetworks
endtoend
delay
queues
+5
votes
1
answer
3
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 ... (1), \theta(1)$ $\theta(1), \theta(n)$ $\theta(n), \theta(1)$ $\theta(n), \theta(n)$
asked
Feb 14
in
DS
by
gatecse
Veteran
(
19.6k
points)

1.4k
views
gate2018
algorithms
datastructure
queues
normal
linkedlists
0
votes
0
answers
4
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 ... time. Both the statements are true. HOW? Kindly provide a detailed explanation. I am unable to solve such questions.
asked
Jan 31
in
DS
by
_jerry
(
369
points)

51
views
madeeasytestseries
datastructure
stack
queues
+1
vote
1
answer
5
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 ... : Circular queues can be implemented with the help of the stack data structure. Which of the following option is false?
asked
Jan 23
in
DS
by
Rishabh Gupta 2
Veteran
(
15.8k
points)

107
views
madeeasytestseries
datastructure
stack
queues
+1
vote
1
answer
6
Implementation of queue using stack
asked
Jan 20
in
Algorithms
by
Hemant Parihar
Veteran
(
15.1k
points)

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

74
views
madeeasytestseries
programminginc
queues
+1
vote
0
answers
8
Implementation of stack using queues
asked
Jan 12
in
DS
by
Ibtisam Sayyad
(
21
points)

65
views
datastructure
stack
queues
+1
vote
0
answers
9
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
in
Programming
by
chandra sai
Active
(
1.7k
points)

104
views
stack
queues
datastructure
0
votes
0
answers
10
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
(
957
points)

62
views
queues
datastructure
+1
vote
0
answers
11
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 ... 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
Boss
(
6.5k
points)

124
views
queues
stack
datastructure
+1
vote
1
answer
12
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 ... (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
Boss
(
6.5k
points)

157
views
datastructure
stack
queues
priorityqueue
+3
votes
1
answer
13
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
Veteran
(
12.6k
points)

424
views
datastructure
queues
stack
+1
vote
2
answers
14
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
(
82.6k
points)

132
views
datastructure
circularqueue
queues
+2
votes
1
answer
15
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
(
655
points)

114
views
linkedlists
datastructure
programminginc
queues
0
votes
1
answer
16
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 ... condition of a circular Queue be: if((Front==0 && Rear==MAX1)  (Rear==Front1)) ???
asked
Oct 24, 2017
in
Programming
by
nick17india
(
79
points)

150
views
queues
datastructure
circularqueue
+4
votes
2
answers
17
Queue implementaion using stack
asked
Oct 9, 2017
in
DS
by
SSrawat
(
157
points)

196
views
stack
queues
datastructure
+1
vote
0
answers
18
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 ... 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
Veteran
(
17.1k
points)

82
views
queues
0
votes
0
answers
19
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
Boss
(
7.9k
points)

75
views
queues
0
votes
1
answer
20
Circular Queue
a)a_cb_ b)_abc_ c)abc_ _ d)_ab_c
asked
Aug 21, 2017
in
Programming
by
Xylene
Loyal
(
4.9k
points)

117
views
datastructure
circularqueue
queues
+1
vote
1
answer
21
queue
The initial configuration of queue is a, b, c, d. ‘a’ is at the front. To get the configuration d, c, b, a how many deletions and additions required: (A) 2 deletions, 3 additions (B) 3 deletions, 2 additions (C) 3 deletions, 4 additions (D) 3 deletions, 3 additions
asked
Jun 27, 2017
in
Programming
by
akankshadewangan24
Loyal
(
4.8k
points)

377
views
queues
0
votes
3
answers
22
#Number of Elements in Circular Queues and Simple Queues #Doubt
asked
Jun 19, 2017
in
DS
by
Roshan Pawar
Junior
(
755
points)

306
views
queues
circularqueue
+1
vote
2
answers
23
#GateForum Correspondence Course (Page# 131, Q# 7), #Queue
asked
Jun 19, 2017
in
DS
by
Roshan Pawar
Junior
(
755
points)

143
views
queues
circular
+1
vote
2
answers
24
Linked List implementation of Queue
asked
Jun 10, 2017
in
Programming
by
Shubhanshu
Veteran
(
16k
points)

361
views
linkedlists
datastructure
queues
+16
votes
7
answers
25
GATE2017213
A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the rear node of the queue, ... to the front node. (I) only. (II) only. Both (I) and (II). Neither (I) nor (II).
asked
Feb 14, 2017
in
DS
by
Madhav
Active
(
2.1k
points)

5.2k
views
gate20172
datastructure
queues
0
votes
2
answers
26
self doubt
A Queue could be implemented using two Stacks. So what will be the time complexity for insertion and deletion in this queue?
asked
Jan 28, 2017
in
Programming
by
Rajesh Raj
Boss
(
5.2k
points)

113
views
stack
queues
0
votes
0
answers
27
Made Easy FLT1 Circular Queue
Doubt: dequeue really deletes the element or just moves the pointer? I'm not getting the answer.
asked
Jan 21, 2017
in
DS
by
target2017
Loyal
(
4.8k
points)

162
views
datastructure
queues
circularqueue
0
votes
0
answers
28
Queue Time Complexity
" Time Complexity of Dequeue will be $ \leq $Time complexity of Enqueue operations " Justify the above statement
asked
Dec 31, 2016
in
DS
by
Dulqar
Loyal
(
3.4k
points)

112
views
timecomplexity
queues
+7
votes
2
answers
29
Queue
A queue is a particular kind of abstract data type. Enqueue and Dequeue makes the queue FIFO data structure. There are several efficient implementations of FIFO queues. An efficient implementation is one which can perform the operations of enququeing and dequeueing in O(1) time. The best choice is : a] DLL c] SLL b] Dynamic Array d] any one of these
asked
Oct 22, 2016
in
Programming
by
KISHALAY DAS
Boss
(
7.7k
points)

261
views
datastructure
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
Dream of M.Tech in IIT
M.Tech preparation
My success story
IIITH Application Form
Another failure attempt
Follow @csegate
Gatecse
Recent questions tagged queues
Recent Blog Comments
Many Congratulations to you and well said. When I ...
Congratulations bhava.. :) Hope we meet at IIT ...
check for what u get in the college predictor of ...
Thank You so much for the edits and making this ...
@Sunny Mukherjee Congratulations and all the best ...
34,170
questions
40,846
answers
115,884
comments
39,703
users