Dark Mode

Recent questions tagged binary-heap

2 votes

2 answers

1

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$

admin asked in DS Feb 15

by admin

1.2k views

0 votes

1 answer

2

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$

GO Classes asked in DS Feb 6

448 views

2 votes

1 answer

3

Algorithm which uses Max heap to find i smallest elements
Can anyone please explain how to find “ i “ smallest elements from an array whose elements are distinct Please use max heap to explain the working input : n distinct elements output : i smallest elements

Thor-o-s asked in DS Sep 1, 2022

164 views

0 votes

0 answers

4

Best Open Video Playlist for Binary heap Topic | Data structures
Please list out the best free available video playlist for Binary heaps from Data structures as an answer here (only one playlist per answer). We'll then select the best playlist and add to GO classroom video lists. You can ... standard ones are more likely to be selected as best. For the full list of selected videos please see here

makhdoom ghaya asked in Study Resources Aug 16, 2022

by makhdoom ghaya

60 views

0 votes

0 answers

5

Best Open Video Playlist for Binary heaps Topic | Data structures
Please list out the best free available video playlist for Binary heaps from Data structures as an answer here (only one playlist per answer). We'll then select the best playlist and add to GO classroom video lists. You can ... standard ones are more likely to be selected as best. For the full list of selected videos please see here

makhdoom ghaya asked in Study Resources Aug 16, 2022

by makhdoom ghaya

69 views

0 votes

1 answer

6

Introduction to Alogrithm
Number of max heap possible with n distinct keys.

Overflow04 asked in DS Jun 29, 2022

136 views

0 votes

2 answers

7

ACE Test Series
A ) B ) C ) D )

ramakrushna asked in DS Jan 27, 2022

408 views

0 votes

1 answer

8

Gate Applied Test Series
A min heap of size 2048 is stored on an array with array indices [1..2048] is stored and the minimum number of comparisons required to determine the maximum of element is _______.(Assume that we are allowed to access the array indexes)

Sagar475 asked in DS Jan 21, 2022

382 views

0 votes

1 answer

9

max heap - algorithms - made easy test series
Consider the following graph: Find the total number of max-heap possible orderings with elements 12, 10, 1, 5, 7, 9, 8 such that each element is filled in one node of the above tree and element 10 occupies only the left child node of its parent.

atulcse asked in DS Jan 16, 2022

352 views

1 vote

2 answers

10

Gate Applied Practice Test
Question--> The time required to find the 99th smallest element from a min heap of n elements is (given that we have access to the array elements)

lalitver10 asked in Programming Jan 13, 2022

637 views

0 votes

2 answers

11

Gate-Applied-test
Which of the following arrays do not represent a min heap. A. 1, 2, 4, 8, 12, 6, 7, 10, 11 7, 10, 12, 11, 17, 19, 2 25, 27, 28, 30, 32, 34, 27 90, 95, 100, 110, 120, 130, 99

lalitver10 asked in Programming Jan 10, 2022

229 views

2 votes

1 answer

12

Applied Test Series
The time required to determine the minimum element from the max heap of size O(log(n)) is given by

LRU asked in DS Nov 3, 2021

by LRU

571 views

1 vote

2 answers

13

Self Doubt
How many min heap possible with 6 distinct node?

Nishisahu asked in DS Sep 23, 2021

272 views

10 votes

4 answers

14

GATE CSE 2021 Set 2 | Question: 2
Let $H$ be a binary min-heap consisting of $n$ elements implemented as an array. What is the worst case time complexity of an optimal algorithm to find the maximum element in $H$? $\Theta (1)$ $\Theta (\log n)$ $\Theta (n)$ $\Theta (n \log n)$

Arjun asked in DS Feb 18, 2021

by Arjun

5.3k views

3 votes

2 answers

15

UGC NET CSE | October 2020 | Part 2 | Question: 24
In a binary max heap containing $n$ numbers, the smallest element can be found in ______ $O(n)$ $O(\log _2 n)$ $O(1)$ $O(\log_2 \log_2 n)$

go_editor asked in DS Nov 20, 2020

887 views

0 votes

1 answer

16

NIELIT 2016 MAR Scientist C - Section C: 49
We have a binary heap on $n$ elements and wish to insert $n$ more elements (not necessarily one after another) into this heap. Total time required for this is $\Theta (\log n)$ $\Theta (n)$ $\Theta (n \log n)$ $\Theta (n^{2})$

Lakshman Patel RJIT asked in DS Apr 2, 2020

by Lakshman Patel RJIT

459 views

Page:

1
2
3
4
next »

Recent questions tagged binary-heap