Register

Recent questions tagged binary-heap

7 votes
2 answers
181
ISRO-DEC2017-45
Match the following and choose the correct answer in the order $A, B,C$ ... be asymptotically tight) $a-q,b- r, c-p$ $a-p, b-q, c-r$ $a-q, b-p, c-r$ $a-r, b-q, c-p$
Match the following and choose the correct answer in the order $A, B,C$$\begin{array}{|ll|ll|} \hline \text{A.} & \text{Heap Construction} & \text{p.} & O(n\log n) \\\hli...
User Avatar
1 votes
1 answer
182
Heap Deletion
For searching an element from heap,then delete it from heap Why will it take O(n+log n) time and not O(n log n) time?
For searching an element from heap,then delete it from heapWhy will it take O(n+log n) time and not O(n log n) time?
User Avatar
7 votes
2 answers
183
Heaps
From an array of size n , we need to find the k bigger elements. What is the data structure we should use to find k bigger element in best asymptotic complexity? 1.A max heap of size n. 2. A max heap of size k. 3. A min heap of size n. 4.A min heap of size k.
From an array of size n , we need to find the k bigger elements. What is the data structure we should use to find k bigger element in best asymptotic complexity? 1.A max ...
User Avatar
0 votes
1 answer
184
data structure
to find the maximum elements in a min heap represnted by an array can be computed in ____________ time a. theta n b.theta n2 c.theta nlogn d.theta 1
to find the maximum elements in a min heap represnted by an array can be computed in ____________ timea. theta nb.theta n2c.theta nlognd.theta 1
User Avatar
2 votes
0 answers
185
HEAP and its properties
Show that there are at most (n/2^h+1) nodes of height h in any n-element heap.
Show that there are at most (n/2^h+1) nodes of height h in any n-element heap.
User Avatar
2 votes
0 answers
186
Worst case running time of MAX_HEAPIFY
Show that the worst case time complexity of MAX_HEAPIFY is Ω(logn ) .
Show that the worst case time complexity of MAX_HEAPIFY is Ω(logn ) .
User Avatar
0 votes
1 answer
189
Cormen Exercise
Why do we want the loop index i in Line 2 of BUILD_MAX_HEAP to decrease from ceil(A.length/2) to 1 rather than increase from 1 to ceil(A.length/2) ?
Why do we want the loop index i in Line 2 of BUILD_MAX_HEAP to decrease from ceil(A.length/2) to 1 rather than increase from 1 to ceil(A.length/2) ?
User Avatar
1 votes
1 answer
190
MadeEasy Subject Test: Programming & DS - Heap
The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all non-leaf nodes of the tree are ________.
The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all non-leaf nodes of the tree are ________.
User Avatar
2 votes
3 answers
191
Max Heap
The number of ways in which the numbers 1, 2, 3, 4, 5 can be inserted into binary heap. Such that resulted binary heap is max heap ________.
The number of ways in which the numbers 1, 2, 3, 4, 5 can be inserted into binary heap. Such that resulted binary heap is max heap ________.
User Avatar
1 votes
1 answer
192
time complexity
To find the kth smallest element in the heap , the time required is O(n), where k is less than the number of element in the heap. is this statement true should not it be O(klogn)
To find the kth smallest element in the heap , the time required is O(n), where k is less than the number of element in the heap. is this statement true should not it be ...
User Avatar
1 votes
1 answer
193
UGC NET CSE | November 2017 | Part 3 | Question: 20
Heap allocation is required for languages that Use dynamic scope rules Support dynamic data structures Support recursion Support recursion and dynamic data structures
Heap allocation is required for languages thatUse dynamic scope rulesSupport dynamic data structuresSupport recursionSupport recursion and dynamic data structures
User Avatar
6 votes
2 answers
194
Min Heap
In a min-heap, the next largest element of a particular element can be found in ___ time. A) O(1) B) O(log n) C) O(n)
In a min-heap, the next largest element of a particular element can be found in ___ time.A) O(1)B) O(log n)C) O(n)
User Avatar
0 votes
1 answer
196
time complexity
time taken to delete a node from min heap if you know the value but not position To find the position of the number in min heap should not be log(n) why is it so O(n)
time taken to delete a node from min heap if you know the value but not positionTo find the position of the number in min heap should not be log(n)why is it so O(n)
User Avatar
0 votes
2 answers
197
UGC NET CSE | December 2008 | Part 2 | Question: 33
In a heap, every element is ___________ of all the elements in the subtree. maximum minimum sum product
In a heap, every element is ___________ of all the elements in the subtree.maximum minimum sum product
User Avatar
2 votes
0 answers
203
CLRS Heapsort, number of nodes of height h ?
Number of node of height h in a binary tree is given as ceiling (n/2^(h+1)) from where this formula come ? I've only found proof by induction or solving for a particular case to say it is true. But didn't get what going behind it.
Number of node of height h in a binary tree is given as ceiling (n/2^(h+1)) from where this formula come ? I've only found proof by induction or solving for a particular ...
User Avatar
0 votes
1 answer
208
Test by Bikram | Mock GATE | Test 3 | Question: 3
What feature of heaps allows them to be efficiently implemented using a partially filled array? Heaps are binary search trees. Heaps contain only integer data. Heaps are full binary trees. Heaps are complete binary trees.
What feature of heaps allows them to be efficiently implemented using a partially filled array?Heaps are binary search trees.Heaps contain only integer data.Heaps are ful...
User Avatar
0 votes
2 answers
209
Choose the correct statement about HEAP
I. A heap is always nearly complete tree. II. Worst case complexity of heapify operation is O( log n) III. Worst case complexity of build heap operation is O( n log n) a. I only b. I and II only c. II and III only d. I, II and III
I. A heap is always nearly complete tree.II. Worst case complexity of heapify operation is O( log n)III. Worst case complexity of build heap operation is O( n log n)a. I ...
User Avatar
6 votes
1 answer
210
Gate Practice Question
A binary min-heap contains keys 1,2,3,4.....2047,2048 What is smallest key that can be at leaf node.??
A binary min-heap contains keys 1,2,3,4.....2047,2048What is smallest key that can be at leaf node.??
User Avatar
Page: