Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged queue
7
votes
1
answer
91
QUEUE USING STACKS
Q.What will be time complexity of enqueue and dequeue operation when a queue is implemented using two stacks.
junaid ahmad
asked
in
DS
Oct 31, 2017
by
junaid ahmad
4.0k
views
data-structures
queue
stack
1
vote
2
answers
92
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,_____,_____
srestha
asked
in
DS
Oct 29, 2017
by
srestha
2.7k
views
data-structures
circular-queue
queue
easy
2
votes
1
answer
93
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.
Shubham Kumar Gupta
asked
in
Programming in C
Oct 26, 2017
by
Shubham Kumar Gupta
3.1k
views
linked-list
data-structures
programming-in-c
queue
0
votes
1
answer
94
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=MAX-1 ; which seems quite straight forward. eg: The ... the overflow condition of a circular Queue be: if((Front==0 && Rear==MAX-1) || (Rear==Front-1)) ???
nick17india
asked
in
Programming in C
Oct 24, 2017
by
nick17india
1.8k
views
queue
data-structures
circular-queue
6
votes
2
answers
95
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 ------- .
SSrawat
asked
in
DS
Oct 9, 2017
by
SSrawat
6.0k
views
stack
queue
data-structures
1
vote
0
answers
96
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???
Hira Thakur
asked
in
DS
Oct 1, 2017
by
Hira Thakur
733
views
queue
2
votes
1
answer
97
Queue implementation using singly linked list
if we implement queue using singly linked list then how juch time enqueue enqueue and dequeue will take ?
rahul sharma 5
asked
in
Programming in C
Sep 28, 2017
by
rahul sharma 5
7.8k
views
data-structures
queue
0
votes
0
answers
98
Queue
If (rear==maxsize-1) 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..
rishu_darkshadow
asked
in
DS
Sep 26, 2017
by
rishu_darkshadow
597
views
queue
1
vote
4
answers
99
UGC NET CSE | June 2009 | Part 2 | Question: 26
Queue is a …………. list . $LIFO$ $LILO$ $FILO$ $FIFO$
rishu_darkshadow
asked
in
DS
Sep 22, 2017
by
rishu_darkshadow
674
views
ugcnetcse-june2009-paper2
data-structures
queue
easy
1
vote
1
answer
100
UGC NET CSE | December 2009 | Part 2 | Question: 23
At a hill station, the parking lot is one long drive way snaking up a hill side. Cars drive in and park right behind the car in front of them, one behind another. A car can’t leave until all the cars in front of it have left. Is the parking lot more like (A) An array (B) A stack (C) A queue (D) A linked list
rishu_darkshadow
asked
in
DS
Sep 17, 2017
by
rishu_darkshadow
2.3k
views
ugcnetcse-dec2009-paper2
data-structures
queue
2
votes
1
answer
101
Circular Queue
a)a_cb_ b)_abc_ c)abc_ _ d)_ab_c
Xylene
asked
in
Programming in C
Aug 21, 2017
by
Xylene
2.0k
views
data-structures
circular-queue
queue
testbook-test-series
15
votes
4
answers
102
#OS #MULTILEVEL FEEDBACK QUEUE
Consider a system which has a CPU bound process,which require the burst time of 40 seconds.The multilevel Feed Back Queue scheduling algorithm is used and the queue time quantum '2' seconds and in each level it is incremented by '5' seconds.Then how many ... which queue the process will terminate the execution? (a) 5,4 (b) 4,5 (c) 3,4 (d) 4,3
junaid ahmad
asked
in
Operating System
Jul 6, 2017
by
junaid ahmad
13.2k
views
operating-system
system
multilevel
feedback
queue
scheduling
1
vote
1
answer
103
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
akankshadewangan24
asked
in
Programming in C
Jun 27, 2017
by
akankshadewangan24
6.7k
views
queue
0
votes
3
answers
104
#Number of Elements in Circular Queues and Simple Queues #Doubt
How many elements a simple queue and a circular queue both of size N can accommodates ? ( A ) N and N respectively. ( B ) N-1 and N-1 respectively. ( C ) N and N-1 respectively. ( D ) N-1 and N respectively.
Roshan Pawar
asked
in
DS
Jun 19, 2017
by
Roshan Pawar
3.1k
views
queue
circular-queue
1
vote
2
answers
105
#GateForum Correspondence Course (Page# 131, Q# 7), #Queue
Which of the following data structure may give overflow error, even though the current number of element in it is less than its size ? (A) Simple Queue (B) Circular Queue (C) Stack (D) None of these
Roshan Pawar
asked
in
DS
Jun 19, 2017
by
Roshan Pawar
3.5k
views
queue
circular
1
vote
3
answers
106
Linked List implementation of Queue
Which of the following is true about linked list implementation of queue? (a) In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end. (b) In push operation, if new nodes are ... (1) TC answer should be (b) But If we are allowed to use doubly linked list then answer should be C only ryt?
Shubhanshu
asked
in
Programming in C
Jun 10, 2017
by
Shubhanshu
54.1k
views
linked-list
data-structures
queue
2
votes
1
answer
107
Test by Bikram | Mock GATE | Test 4 | Question: 7
Consider the following statements: $S_1$: If a STACK is implemented through a LINKED LIST, $\text{PUSH}$ operation will take $O\left ( 1 \right )$ time and $\text{POP}$ operation will take $O\left ( n \right )$ time. $S_2$: If a QUEUE ... $S_1$ is correct. Only $S_2$ is correct. Neither $S_1$ nor $S_2$ is correct. Both $S_1$ and $S_2$ are correct.
Bikram
asked
in
DS
May 14, 2017
by
Bikram
758
views
tbb-mockgate-4
data-structures
stack
queue
35
votes
11
answers
108
GATE CSE 2017 Set 2 | Question: 13
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, respectively ... to the front node. (I) only. (II) only. Both (I) and (II). Neither (I) nor (II).
Madhav
asked
in
DS
Feb 14, 2017
by
Madhav
27.3k
views
gatecse-2017-set2
data-structures
queue
0
votes
2
answers
109
self doubt
A Queue could be implemented using two Stacks. So what will be the time complexity for insertion and deletion in this queue?
Rajesh Raj
asked
in
Programming in C
Jan 28, 2017
by
Rajesh Raj
562
views
stack
queue
0
votes
0
answers
110
Made Easy FLT1 Circular Queue
Doubt: dequeue really deletes the element or just moves the pointer? I'm not getting the answer.
target2017
asked
in
DS
Jan 21, 2017
by
target2017
966
views
data-structures
queue
circular-queue
2
votes
1
answer
111
MadeEasy Subject Test: Programming & DS - Queues
# plz check ??? i missed something
Hradesh patel
asked
in
DS
Jan 13, 2017
by
Hradesh patel
488
views
made-easy-test-series
data-structures
queue
0
votes
0
answers
112
Queue Time Complexity
" Time Complexity of Dequeue will be $ \leq $Time complexity of Enqueue operations " Justify the above statement
Dulqar
asked
in
DS
Dec 31, 2016
by
Dulqar
517
views
time-complexity
queue
7
votes
2
answers
113
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
KISHALAY DAS
asked
in
Programming in C
Oct 22, 2016
by
KISHALAY DAS
1.6k
views
data-structures
queue
1
vote
2
answers
114
GATE Overflow | Data Structures | Test 1 | Question: 29
Which of the following is false? Arrays are better than linked lists for sorting due to better data locality. Asymptotic time complxity for FindMax is same on an unsorted array as that on a singly linked list. A doubly linked list ... as of a singly linked list. Given a fixed maximum size, a circular queue is preferrable to a normal queue
Arjun
asked
in
DS
Oct 10, 2016
by
Arjun
875
views
go-ds-1
data-structures
array
queue
1
vote
1
answer
115
UGC NET CSE | August 2016 | Part 2 | Question: 24
Consider the following statements : $S_{1}$ : A queue can be implemented using two stacks. $S_{2}$ : A stack can be implemented using two queues. Which of the following is correct ? $S_{1}$ is correct and $S_{2}$ is not correct. $S_{1}$ is not ... $S_{1}$ and $S_{2}$ are correct. Both $S_{1}$ and $S_{2}$ are not correct.
makhdoom ghaya
asked
in
DS
Sep 26, 2016
by
makhdoom ghaya
4.6k
views
ugcnetcse-aug2016-paper2
data-structures
queue
stack
2
votes
2
answers
116
UGC NET CSE | June 2011 | Part 2 | Question: 25
When the priority queue is represented by max heap, the insertion and deletion of an element can be performed in (queue containing $n$ elements) $\theta(n)$ and $\theta(1)$ respectively $\theta(n)$ and $\theta(n)$ respectively $\theta(1)$ and $\theta(1)$ respectively None of the above
makhdoom ghaya
asked
in
Others
Aug 24, 2016
by
makhdoom ghaya
2.4k
views
ugcnetcse-june2011-paper2
data-structures
queue
binary-heap
1
vote
2
answers
117
UGC NET CSE | September 2013 | Part 2 | Question: 12
The efficient data structure to insert/delete a number in a stored set of number is Queue Linked list Doubly linked list Binary tree
go_editor
asked
in
DS
Jul 20, 2016
by
go_editor
4.5k
views
ugcnetsep2013ii
data-structures
queue
linked-list
143
votes
12
answers
118
GATE CSE 2016 Set 1 | Question: 41
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. $Head(Q)$ returns the element at the head of the queue $Q$ without removing it from $Q$. Similarly $Top(S)$ returns the element at the top of $S$ without removing ... = Pop(S); Enqueue (Q, x); end end The maximum possible number of iterations of the while loop in the algorithm is _______.
Sandeep Singh
asked
in
DS
Feb 12, 2016
by
Sandeep Singh
34.7k
views
gatecse-2016-set1
data-structures
queue
difficult
numerical-answers
61
votes
4
answers
119
GATE CSE 2016 Set 1 | Question: 10
A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT ($n$ refers to the number of items in the queue) ? Both operations can be performed in $O(1)$ ... both operations will be $\Omega (n)$. Worst case time complexity for both operations will be $\Omega (\log n)$
Sandeep Singh
asked
in
DS
Feb 12, 2016
by
Sandeep Singh
23.2k
views
gatecse-2016-set1
data-structures
queue
normal
1
vote
2
answers
120
Implementing Queue with only one pointer
Which of the following statement is/are correct? 1. If we use only Front pointer in queue, then insertion takes O(n) time while deletion in O(1) time. 2. If we use only Rear pointer in queue, then insertion is O(1) and deletion is not possible.
Tushar Shinde
asked
in
DS
Dec 7, 2015
by
Tushar Shinde
2.4k
views
queue
data-structures
Page:
« prev
1
2
3
4
5
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged queue
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...