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 priority-queue
0
votes
1
answer
1
Made easy workbook question
Q.which of the following data structure cannot be used for efficient implementation of Priority Queue? a. Binary heap b. Height balanced binary tree. c. Sorted array
Shraddha dwevedi
asked
in
DS
Nov 25, 2021
by
Shraddha dwevedi
186
views
made-easy-booklet
data-structures
priority-queue
1
vote
2
answers
2
NIELIT 2017 July Scientist B (CS) - Section B: 8
A priority queue is implemented as a Max-Heap. Initially, it has $5$ elements. The level-order traversal of the heap is: $10,8,5,3,2$. Two new elements $1$ and $7$ are inserted into the heap in that order. The level-order traversal of the heap after the insertion of the elements is $10,8,7,3,2,1,5$ $10,8,7,2,3,1,5$ $10,8,7,1,2,3,5$ $10,8,7,5,3,2,1$
Lakshman Patel RJIT
asked
in
DS
Mar 30, 2020
by
Lakshman Patel RJIT
551
views
nielit2017july-scientistb-cs
data-structures
priority-queue
heap
0
votes
0
answers
3
Cormen Edition 3 Exercise 6.5 Question 7 (Page No. 166)
Show how to implement a first-in, first-out queue with a priority queue. Show how to implement a stack with a priority queue.
akash.dinkar12
asked
in
Algorithms
Jun 27, 2019
by
akash.dinkar12
195
views
cormen
algorithms
heap
priority-queue
descriptive
0
votes
0
answers
4
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
srestha
asked
in
DS
Dec 22, 2018
by
srestha
425
views
data-structures
priority-queue
queue
0
votes
2
answers
5
Process Scheduling
rohan.1737
asked
in
Operating System
Oct 22, 2018
by
rohan.1737
402
views
process-scheduling
priority-queue
0
votes
1
answer
6
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 min-heap priority queue keeping above assumption of assigning priorities to newly inserted element?
pallaviamu
asked
in
DS
Jun 17, 2018
by
pallaviamu
962
views
data-structures
priority-queue
descriptive
2
votes
1
answer
7
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()
Parshu gate
asked
in
DS
Nov 12, 2017
by
Parshu gate
946
views
data-structures
stack
queue
priority-queue
1
vote
1
answer
8
Test by Bikram | Mock GATE | Test 1 | Question: 32
Fill in the blanks in the procedure: void Prod (Element Type X, Priority Queue H) { int i; if (IsFull(H)) { Error ("Priority queue is full"); return; } for (i=++H -> size; H -> Elements [i/2]>X; i/=2) _________________ } ... 2]=H$\rightarrow$ Elements $[i/2]$; $H$\rightarrow$ Elements $[i^2 ]=X;$ $H$\rightarrow$ Elements $[i]=X;$
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
535
views
tbb-mockgate-1
data-structures
priority-queue
0
votes
1
answer
9
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
rahul sharma 5
asked
in
Programming
Dec 18, 2016
by
rahul sharma 5
875
views
data-structures
priority-queue
test-series
4
votes
4
answers
10
GATE Overflow | Data Structures | Test 1 | Question: 5
A stack is used to implement a priority queue where $ENQUEUE(Q, x, p)$ ($p$ denotes priority, higher the better) and $DEQUE(Q)$ are implemented by appropriate PUSH and POP operations such that $DEQUE(Q)$ happens in $O(1)$. ... second element denotes the priority. No. of POP operations required on the given stack for $ENQUEUE(Q, 2, 0)$ is _____
Arjun
asked
in
DS
Oct 10, 2016
by
Arjun
592
views
go-ds-1
data-structures
stack
priority-queue
numerical-answers
1
vote
1
answer
11
UGC NET CSE | August 2016 | Part 3 | Question: 34
A priority queue is implemented as a max-heap. 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 level-order traversal of the heap after ... 18, 17, 12, 13, 10, 15 20, 18, 17, 10, 12, 13, 15 20, 18, 17, 13, 12, 10, 15
makhdoom ghaya
asked
in
DS
Oct 1, 2016
by
makhdoom ghaya
2.3k
views
ugcnetcse-aug2016-paper3
data-structures
priority-queue
0
votes
2
answers
12
UGC NET CSE | June 2010 | Part 2 | Question: 22
What is the most appropriate data structure to implement a priority queue ? Heap Circular array Linked list Binary tree
makhdoom ghaya
asked
in
DS
Sep 16, 2016
by
makhdoom ghaya
3.3k
views
ugcnetcse-june2010-paper2
data-structures
priority-queue
1
vote
1
answer
13
Priority Queue
How many minimum queues are required to implement a priority queue?
tripathiambuj
asked
in
DS
Jun 22, 2016
by
tripathiambuj
1.1k
views
priority-queue
data-structures
46
votes
4
answers
14
GATE CSE 1997 | Question: 4.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 ... For a sequence of operations, the keys chosen are in non-increasing order non-decreasing order strictly increasing order strictly decreasing order
Kathleen
asked
in
DS
Sep 29, 2014
by
Kathleen
18.2k
views
gate1997
data-structures
stack
normal
priority-queue
To see more, click for the
full list of questions
or
popular tags
.
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
RECRUITMENT IN OIL AND GAS CORPORATION LIMITED
Aptitude Overflow Book
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(647)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent questions tagged priority-queue
Recent Blog Comments
@abir_banerjee Thanks Abir. I'm third year...
@nolan_keats Currently I am in third year...
@abir_banerjee thank you Abir.Supposing you...
@nolan_keats just a suggestion as I also...
@abir_banerjee Hope I can do this in span of one...