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
Slides
Recent questions tagged binary-heap
1
vote
1
answer
151
Min Heap & Probability
A min-heap contains $2^{(h + 1)} -1$ elements. If we randomly traverse the tree such that there is an equal probability of going left or right at each node, what is the probability of reaching the largest element?
Rishabh Malhotra
asked
in
DS
Feb 24, 2018
by
Rishabh Malhotra
574
views
data-structures
binary-heap
probability
0
votes
0
answers
152
Heap Smallest Element
My question is in Question like find 5th Smallest element in a heap: It requires O(logn) time if we do only Delete operation 5 Times.But what if the array contains no 5th smallest element say our array contain [1,1,1,1,1,1,1,1,1,1] now ... need to do extract min operation n number of times which would give nlogn time? Plz Clear my doubt https://gateoverflow.in/1110/gate2003-23
Na462
asked
in
Algorithms
Feb 17, 2018
by
Na462
786
views
binary-heap
algorithms
67
votes
14
answers
153
GATE CSE 2018 | Question: 46
The number of possible min-heaps containing each value from $\{1,2,3,4,5,6,7\}$ exactly once is _______
gatecse
asked
in
DS
Feb 14, 2018
by
gatecse
38.9k
views
gatecse-2018
binary-heap
numerical-answers
combinatory
2-marks
0
votes
1
answer
154
MadeEasy Test Series: Programming & DS - Programming In C
Consider the C node fragment given below: Which of the following true about above code if input is given as linked list of n-element in which for each node memory is created in heap area? A. Compiles successfully but execution may ... in else part. I think answer should be C. Because the return type is int node* Can someone please confirm.
Rishabh Gupta 2
asked
in
Programming in C
Jan 30, 2018
by
Rishabh Gupta 2
1.1k
views
made-easy-test-series
programming-in-c
pointers
structure
linked-list
binary-heap
3
votes
2
answers
155
TEST SERIES
PLZ EXPLAIN?
Abhi Girin
asked
in
DS
Jan 23, 2018
by
Abhi Girin
510
views
data-structures
binary-heap
numerical-answers
made-easy-test-series
2
votes
1
answer
156
Ace Test Series: Data Structures - Heap And Time Complexity
I think its none of the above?
rasto mapp
asked
in
DS
Jan 21, 2018
by
rasto mapp
663
views
ace-test-series
data-structures
binary-heap
4
votes
2
answers
157
Datastructres
The number of distinct max heap are possible with keys 1, 2, 3, 4, 5 are ________.
MIRIYALA JEEVAN KUMA
asked
in
DS
Jan 20, 2018
by
MIRIYALA JEEVAN KUMA
944
views
binary-heap
algorithms
data-structures
4
votes
1
answer
158
Max heap no. of interchange required
Lakshman Bhaiya
asked
in
DS
Jan 7, 2018
by
Lakshman Bhaiya
902
views
data-structures
binary-heap
2
votes
1
answer
159
gateforum test series
i'm getting 5 but the answer given is 4
charul
asked
in
DS
Jan 3, 2018
by
charul
410
views
data-structures
binary-heap
numerical-answers
gateforum-test-series
1
vote
0
answers
160
MadeEasy Test Series: Programming & DS - Heap
How to solve such a problem?
Kalpataru Bose
asked
in
DS
Dec 31, 2017
by
Kalpataru Bose
575
views
made-easy-test-series
data-structures
binary-heap
programming-in-c
array
5
votes
0
answers
161
Min heap tree
Answer given : 1935360 but I m getting 3225600 please check..
vamp_vaibhav
asked
in
Programming in C
Dec 29, 2017
by
vamp_vaibhav
575
views
min
binary-heap
7
votes
2
answers
162
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$
gatecse
asked
in
DS
Dec 17, 2017
by
gatecse
1.9k
views
isrodec2017
binary-heap
data-structures
1
vote
1
answer
163
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?
srestha
asked
in
DS
Dec 8, 2017
by
srestha
507
views
data-structures
binary-heap
time-complexity
7
votes
2
answers
164
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.
Warlock lord
asked
in
Algorithms
Dec 5, 2017
by
Warlock lord
1.2k
views
binary-heap
algorithms
data-structures
0
votes
1
answer
165
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
akankshadewangan24
asked
in
DS
Dec 2, 2017
by
akankshadewangan24
303
views
data-structures
binary-heap
time-complexity
2
votes
0
answers
166
HEAP and its properties
Show that there are at most (n/2^h+1) nodes of height h in any n-element heap.
dragonball
asked
in
Algorithms
Nov 10, 2017
by
dragonball
276
views
algorithms
binary-heap
2
votes
0
answers
167
Worst case running time of MAX_HEAPIFY
Show that the worst case time complexity of MAX_HEAPIFY is Ω(logn ) .
dragonball
asked
in
Algorithms
Nov 10, 2017
by
dragonball
208
views
algorithms
binary-heap
1
vote
0
answers
168
Time Complexity of Max_heapify(A,i) (CLR 3rd edition Page no. 155)
The running time of MAX_HEAPIFY on a subtree of size n rooted at a given node i is the Thete(1) time to fix up the relationships among the element A[i] , A[LEFT(i)] and A[RIGHT(i)] , plus the time to run the ... MAX_HEAPIFY by the recurrence - T(n) <= T(2n/3) + theta(1) Could anyone explain the bold lines in detail ?
dragonball
asked
in
Algorithms
Nov 10, 2017
by
dragonball
292
views
algorithms
binary-heap
5
votes
1
answer
169
Heap - Please explain first statement
ankitgupta.1729
asked
in
DS
Nov 9, 2017
by
ankitgupta.1729
823
views
data-structures
binary-heap
test-series
time-complexity
0
votes
1
answer
170
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) ?
Ashwani Kumar 2
asked
in
DS
Nov 8, 2017
by
Ashwani Kumar 2
467
views
data-structures
binary-heap
cormen
descriptive
1
vote
1
answer
171
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 ________.
sunaina rawat
asked
in
DS
Nov 7, 2017
by
sunaina rawat
772
views
made-easy-test-series
data-structures
binary-heap
2
votes
3
answers
172
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 ________.
shivangi5
asked
in
DS
Nov 7, 2017
by
shivangi5
3.1k
views
binary-heap
data-structures
1
vote
1
answer
173
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)
Kaluti
asked
in
DS
Nov 6, 2017
by
Kaluti
317
views
data-structures
binary-heap
time-complexity
1
vote
1
answer
174
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
Arjun
asked
in
DS
Nov 5, 2017
by
Arjun
545
views
ugcnetcse-nov2017-paper3
data-structures
binary-heap
6
votes
2
answers
175
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)
Shivam Chauhan
asked
in
DS
Oct 31, 2017
by
Shivam Chauhan
4.9k
views
data-structures
binary-heap
time-complexity
0
votes
0
answers
176
Data Structure: Find 7th smallest element in Min heap
In a binary min heap with n elements, the 7th smallest element can be found in _____ ? Answer given is O(logn) and solution:- Delete the 1st smallest element O(logn) Delete the 2nd smallest element O(logn) .... ... this solution the data arrangement of the heap will be changed after performing these operation. any better solution than this???
Shubhanshu
asked
in
Programming in C
Oct 18, 2017
by
Shubhanshu
1.5k
views
binary-heap
time-complexity
algorithms
0
votes
1
answer
177
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)
Kaluti
asked
in
DS
Oct 14, 2017
by
Kaluti
436
views
data-structures
binary-heap
time-complexity
0
votes
2
answers
178
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
rishu_darkshadow
asked
in
DS
Sep 26, 2017
by
rishu_darkshadow
1.2k
views
ugcnetcse-dec2008-paper2
data-structures
binary-heap
1
vote
1
answer
179
MAX-HEAP increase key procedure
In the max heap Increase key procedure IncreaseKey(int pos, int newValue) { heap[pos] = newValue; while(left(pos) < heap.Length) { int smallest = left(pos); if(heap[right(pos)] < heap[left(pos)]) smallest = right(pos); if(heap[ ... property is violated at a node x, we dont call MAX-HEAPIFY procedure to mend the Max-heap property, What is the reason behind it?
vivek9837
asked
in
DS
Sep 14, 2017
by
vivek9837
1.6k
views
data-structures
binary-heap
descriptive
0
votes
1
answer
180
cormen page 157-159
While proving that the running time of the BUILD-MAX-HEAP to be O(n) and not O(n lgn), the have considered the number of nodes or elements at some height 'h' to be n/2^(h+1). How? All I know is that 2^h alone can give you number of nodes at some heigh h. I do not understand this. Can someone explain in detail?
Warlock lord
asked
in
DS
Sep 10, 2017
by
Warlock lord
306
views
data-structures
binary-heap
Page:
« prev
1
2
3
4
5
6
7
8
9
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged binary-heap
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...