Recent questions tagged binary-heap / GATE Overflow for GATE CSE

3 votes

1 answer

1

GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 17
Suppose that a binary min-heap stores six elements with priorities $10,20,30,40,50$, and $60$ in its array $\text{A}.$ What is the largest of these items that could be stored in $\text{A}[2]?$ (indexing starts from zero)

Suppose that a binary min-heap stores six elements with priorities $10,20,30,40,50$, and $60$ in its array $\text{A}.$ What is the largest of these items that could be st...

GO Classes

488 views

GO Classes asked Jan 28

6 votes

0 answers

2

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 52
Consider the following binary heap – Suppose the last operation you performed in the binary heap above was inserting the key $x$. What are the possible values of $x?$ $20$ $8$ $13$ $11$

Consider the following binary heap –Suppose the last operation you performed in the binary heap above was inserting the key $x$.What are the possible values of $x?$$20$...

GO Classes

522 views

GO Classes asked Jan 13

0 votes

1 answer

3

Made easy Data structures
Consider the following array of elements <96,42,50,17,15,5,7,11,39,23,6,9,19,100,12> The minimum number of interchanges using buildheap needed to convert it into a max heap is

Consider the following array of elements<96,42,50,17,15,5,7,11,39,23,6,9,19,100,12>The minimum number of interchanges using buildheap needed to convert it into a max heap...

amitarp818

607 views

amitarp818 asked Nov 28, 2023

0 votes

1 answer

4

Consider the following algorithm for Build-Max-heap and the given array A=[ 47, 96, 35, 54, 77, 65, 83]. Run this algorithm on the given array and redraw the heap and the heap- array whenever the swapping takes place. dry run this statement

Consider the following algorithm for Build-Max-heap and the given array A=[ 47,96, 35, 54, 77, 65, 83]. Run this algorithm on the given array and redraw the heap and the ...

syedasafoora

246 views

syedasafoora asked Nov 8, 2023

0 votes

2 answers

5

Self Doubt
The Total Combinations Possible of Min heap with 8 Distinct elements are ?

The Total Combinations Possible of Min heap with 8 Distinct elements are ?

viral8702

282 views

viral8702 asked Sep 21, 2023

0 votes

1 answer

6

UGC NET CSE | June 2023 | Part 2: 21
Consider the following statements about heap sort algorithm: The MAX-HEAPIFY procedure which runs in $\mathrm{O} \lg (n)$ time, is the key to maintaining the max heap property The BUILD-MAX-HEAP procedure, which runs in $\mathrm{O} \lg (n)$ time, produces max-heap from an unordered ... $\text{A, B}$ only $\text{A, C}$ only $\text{B, D}$ only $\text{A, B, C, D}$

Consider the following statements about heap sort algorithm:The MAX-HEAPIFY procedure which runs in $\mathrm{O} \lg (n)$ time, is the key to maintaining the max heap prop...

admin

420 views

admin asked Jul 28, 2023

1 votes

1 answer

7

GO Classes 2023 | IIITH Mock Test 1 | Question: 15
In an array-based implementation of a Heap, the right-child of the right-child of the node at index $i,$ if it exists, can be found at what array location? Index of the array starts from $1.$ $4i + 3$ $2i + 1$ $4i + 1$ $2i + 2$

In an array-based implementation of a Heap, the right-child of the right-child of the node at index $i,$ if it exists, can be found at what array location? Index of the a...

GO Classes

917 views

GO Classes asked Mar 26, 2023

1 votes

2 answers

8

GO Classes 2023 | IIITH Mock Test 1 | Question: 32
Consider a min-heap with $6$ distinct elements. How many positions can be taken by $3^{\text{rd}}$ minimum element? $2$ $3$ $4$ $5$

Consider a min-heap with $6$ distinct elements. How many positions can be taken by $3^{\text{rd}}$ minimum element?$2$$3$$4$$5$

GO Classes

699 views

GO Classes asked Mar 26, 2023

14 votes

3 answers

9

GATE CSE 2023 | Question: 2
Which one of the following sequences when stored in an array at locations $A[1], \ldots, A[10]$ forms a max-heap? $23,17,10,6,13,14,1,5,7,12$ $23,17,14,7,13,10,1,5,6,12$ $23,17,14,6,13,10,1,5,7,15$ $23,14,17,1,10,13,16,12,7,5$

Which one of the following sequences when stored in an array at locations $A , \ldots, A[10]$ forms a max-heap?$23,17,10,6,13,14,1,5,7,12$$23,17,14,7,13,10,1,5,6,12$$23,1...

admin

6.7k views

admin asked Feb 15, 2023

7 votes

3 answers

10

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

2 votes

1 answer

11

GATE CSE 2023 | Memory Based Question: 41
Which one of the following sequences when stored in an array at locations A[1],...,A[10] forms a max-heap? $23\; 17\; 10\; 6\; 13\; 14\; 1\; 5 \;9 \;12$ $23 \;14 \;19 \;1 \;10 \;13 \;16 \;12 \;7 \;5$ $23 \;17\; 14\; 6\; 13\; 10\; 1\; 5\; 7\; 15$ $23 \;17\; 14\; 7\; 13\; 10\; 1\; 5\; 6\; 12$

Which one of the following sequences when stored in an array at locations A ,...,A[10] forms a max-heap?$23\; 17\; 10\; 6\; 13\; 14\; 1\; 5 \;9 \;12$$23 \;14 \;19 \;1 \;1...

GO Classes

5.0k views

GO Classes asked Feb 5, 2023

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