The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
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 priorityqueue
0
votes
3
answers
1
GATEBOOK2019 Grand Test DS&A14
Suppose that an application has a huge number of $\text{INSERT}$ operations, but only a few $\text{DELETE_MAX}$ operations. Which of the following priorityqueue implementations will be most effective? $\text{Max heap}$ $\text{Unordered array}$ $\text{Ordered array}$ $\text{Binary search tree}$
asked
Jan 6
in
Algorithms
by
GATEBOOK
Boss
(
11.4k
points)

91
views
gb2019gtdsa
priorityqueue
0
votes
0
answers
2
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
(
111k
points)

65
views
datastructure
priorityqueue
queues
0
votes
1
answer
3
Process Scheduling
asked
Oct 22, 2018
in
Operating System
by
rohan.1737
(
131
points)

64
views
processschedule
priorityqueue
0
votes
1
answer
4
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
(
461
points)

247
views
clrs
datastructure
stack
queues
priorityqueue
+1
vote
1
answer
5
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
(
3.1k
points)

353
views
datastructure
stack
queues
priorityqueue
0
votes
1
answer
6
Priority queue stack
How to implement Priority queue using stack?What will be time complexity for Enqueue and Dequeue operations? Edit: Updated the question clearly
asked
Dec 18, 2016
in
Programming
by
rahul sharma 5
Boss
(
24.2k
points)

301
views
datastructure
priorityqueue
testseries
+1
vote
1
answer
7
UGCNETAUG2016III34
A priority queue is implemented as a maxheap. Initially, it has five elements. The levelorder traversal of the heap is as follows : 20, 18, 15, 13, 12 Two new elements 10' and 17' are inserted in the heap in that order. The levelorder traversal of the heap after the insertion of the ... 10 20, 18, 17, 12, 13, 10, 15 20, 18, 17, 10, 12, 13, 15 20, 18, 17, 13, 12, 10, 15
asked
Oct 1, 2016
in
Others
by
makhdoom ghaya
Boss
(
29.3k
points)

757
views
ugcnetaug2016iii
datastructure
priorityqueue
0
votes
1
answer
8
UGCNETJune2010II22
What is the most appropriate data structure to implement a priority queue ? Heap Circular array Linked list Binary tree
asked
Sep 16, 2016
in
DS
by
makhdoom ghaya
Boss
(
29.3k
points)

474
views
ugcnetjune2010ii
datastructure
priorityqueue
+1
vote
1
answer
9
Priority Queue
How many minimum queues are required to implement a priority queue?
asked
Jun 22, 2016
in
DS
by
tripathiambuj
(
11
points)

537
views
priorityqueue
datastructure
+28
votes
3
answers
10
GATE19974.7
A priority queue $Q$ is used to implement a stack that stores characters. PUSH (C) is implemented as INSERT $(Q, C, K)$ where $K$ is an appropriate integer key chosen by the implementation. POP is implemented as DELETEMIN$(Q)$. For a sequence of operations, the keys chosen are in nonincreasing order nondecreasing order strictly increasing order strictly decreasing order
asked
Sep 29, 2014
in
DS
by
Kathleen
Veteran
(
52k
points)

4.1k
views
gate1997
datastructure
stack
normal
priorityqueue
To see more, click for the
full list of questions
or
popular tags
.
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
The day that made me an IIScian :)
Unanswered Previous year GATE/TIFR questions
From being a Failure to getting into IISc  (Rank 888, Score 692)
My interview experience at IITs/IISc
IIT Delhi CSE Mtech interview 14 may
Follow @csegate
Recent questions tagged priorityqueue
Recent Blog Comments
@Debargh, Yes. 👍
Thanks. Regarding the probability question, was...
Thanks
What were the Eigen values of A apart from 0? I...
49,540
questions
54,099
answers
187,269
comments
71,006
users