Recent questions tagged priority-queue / GATE Overflow for GATE CSE

1 votes

3 answers

1

ISRO 2024
In a priority queue, insertion and deletion can be done at Front back Middle Any position

In a priority queue, insertion and deletion can be done atFrontbackMiddleAny position

Ramayya

450 views

Ramayya asked Jan 7

7 votes

3 answers

2

GATE CSE 2023 | Question: 36
Let $A$ be a priority queue for maintaining a set of elements. Suppose $A$ is implemented using a max-heap data structure. The operation $\text{EXTRACT-MAX} (A)$ extracts and deletes the maximum element from $A$. The operation $\operatorname{INSERT}(A, key )$ inserts a new ... $O(1)$ whereas $\operatorname{INSERT}(A, k e y)$ runs in $O(\log (n))$.

Let $A$ be a priority queue for maintaining a set of elements. Suppose $A$ is implemented using a max-heap data structure. The operation $\text{EXTRACT-MAX} (A)$ extracts...

admin

6.2k views

admin asked Feb 15, 2023

0 votes

1 answer

3

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

Q.which of the following data structure cannot be used for efficient implementation of Priority Queue?a. Binary heapb. Height balanced binary tree.c. Sorted array

Shraddha dwevedi

340 views

Shraddha dwevedi asked Nov 24, 2021

2 votes

2 answers

4

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$

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 in...

admin

1.0k views

admin asked Mar 30, 2020

0 votes

0 answers

5

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.

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

371 views

akash.dinkar12 asked Jun 27, 2019

0 votes

0 answers

6

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

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 specia...

srestha

598 views

srestha asked Dec 22, 2018

0 votes

2 answers

7

Process Scheduling

rohan.1737

715 views

rohan.1737 asked Oct 22, 2018

0 votes

1 answer

8

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?

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 o...

pallaviamu

1.1k views

pallaviamu asked Jun 17, 2018

2 votes

1 answer

9

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()

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 co...

Parshu gate

1.2k views

Parshu gate asked Nov 11, 2017

2 votes

1 answer

10

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;$

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; ...

Bikram

1.1k views

Bikram asked Jan 16, 2017

0 votes

1 answer

11

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

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

993 views

rahul sharma 5 asked Dec 17, 2016

5 votes

4 answers

12

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 _____

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 PO...

Arjun

1.1k views

Arjun asked Oct 10, 2016

1 votes

1 answer

13

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

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, 12Two new elements ‘...

makhdoom ghaya

2.6k views

makhdoom ghaya asked Oct 1, 2016

0 votes

2 answers

14

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

What is the most appropriate data structure to implement a priority queue ?HeapCircular arrayLinked listBinary tree

makhdoom ghaya

5.9k views

makhdoom ghaya asked Sep 15, 2016

1 votes

1 answer

15

Priority Queue
How many minimum queues are required to implement a priority queue?

How many minimum queues are required to implement a priority queue?

tripathiambuj

1.5k views

tripathiambuj asked Jun 22, 2016

56 votes

5 answers

16

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

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 ...

Kathleen

24.5k views

Kathleen asked Sep 29, 2014

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