The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged heap
0
votes
2
answers
1
UGCNETdec2008ii33
In a heap, every element is …………… of all the elements in the subtree. (A) maximum (B) minimum (C) sum (D) product
asked
Sep 26, 2017
in
DS
by
rishu_darkshadow
Loyal
(
7.2k
points)

256
views
ugcnetdec2008ii
datastructure
heap
+1
vote
1
answer
2
MAXHEAP 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 MAXHEAPIFY procedure to mend the Maxheap property, What is the reason behind it?
asked
Sep 15, 2017
in
Algorithms
by
vivek9837
Junior
(
835
points)

307
views
algorithms
heap
0
votes
1
answer
3
How does memory layout of a program depend on address binding technique?
I have learned that with runtime address binding, the program can be allocated frames in the physical memory noncontiguously. Also, as described here and here, every segment of the program in the logical address space is ... placed together with the rest of the segments or separately just as in the case of runtime binding ?
asked
Mar 27, 2017
in
Operating System
by
Aman Vats
Junior
(
713
points)

579
views
operatingsystem
memorymanagement
heap
stack
compilerdesign
virtualmemory
+6
votes
1
answer
4
Gate Practice Question
A binary minheap contains keys 1,2,3,4.....2047,2048 What is smallest key that can be at leaf node.??
asked
Feb 3, 2017
in
Algorithms
by
Ravi_1511
Active
(
2k
points)

301
views
heap
+2
votes
0
answers
5
Min heap
how to solve this please explain procedure...
asked
Feb 1, 2017
in
Programming
by
S Ram
Active
(
1.7k
points)

257
views
heap
testseries
+4
votes
1
answer
6
Time to build a heap
If you are given a sorted list with n elements in ascending order. Then what will be the Time complexity to build a Min heap from the given array?
asked
Jan 18, 2017
in
Algorithms
by
Gaurab Ghosh
Active
(
2.2k
points)

386
views
algorithms
heap
timecomplexity
+1
vote
2
answers
7
binary heap
Consider a binary min heap containing n elements and every node is having degree 2 ( i.e. full binary min heap tree). What is the probability of finding the largest element at the last level ? According to my understanding the largest elemenyt has to be a leaf and since leafs can be on two levels last and second last therefore the probability should be 1/2
asked
Jan 15, 2017
in
Algorithms
by
Pankaj Joshi
Active
(
2.6k
points)

278
views
heap
binaryheap
algorithms
geekmock2017
+1
vote
1
answer
8
MadeEasy Subject Test: Programming & DS  Heap
How come the answer is 8 I think it shoulb be 4.
asked
Jan 15, 2017
in
DS
by
harshit agarwal
(
169
points)

234
views
madeeasytestseries
datastructure
heap
+1
vote
0
answers
9
How to convert BST to max/min heap inplace ?
Please explain using images how to convert BST into max/min heap inplace . Please explain the complexity of doing so.
asked
Jan 10, 2017
in
Algorithms
by
Anjana Babu
Active
(
1k
points)

611
views
algorithms
heap
0
votes
1
answer
10
MadeEasy Subject Test: Programming & DS  Heap
It should be 5 according to me.Pleas explain if they are correct.
asked
Jan 8, 2017
in
DS
by
Lucky sunda
Active
(
4.5k
points)

146
views
madeeasytestseries
datastructure
heap
+24
votes
4
answers
11
min heap
The number of binary min. heaps that can be formed from a set of 7 distinct integers is _________?
asked
Jan 7, 2017
in
DS
by
Jithin Jayan
Active
(
1.6k
points)

5k
views
algorithms
heap
permutationandcombination
+14
votes
7
answers
12
Heap..
1)The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all nonleaf nodes of the tree are ________.  2)The number of min heap trees are possible with 15 elements_________________
asked
Jan 3, 2017
in
Programming
by
srestha
Veteran
(
117k
points)

1.1k
views
heap
+7
votes
2
answers
13
Max Heap
The number of ways , in which numbers 1,2,3,4,5 can be inserted into binary heap,such that resultant binary heap is max heap ? given ans :8
asked
Dec 9, 2016
in
Programming
by
minal
Boss
(
17k
points)

1.2k
views
heap
binaryheap
algorithms
+5
votes
2
answers
14
MadeEasy Test Series: Programming & DS  Heap
The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all nonleaf nodes of the tree are ________.
asked
Dec 6, 2016
in
DS
by
Vishal Goyal
Active
(
1.8k
points)

283
views
madeeasytestseries
datastructure
heap
+2
votes
2
answers
15
MadeEasy Test Series: Algorithms  Heap
Consider M1 and M2 be two complete binary tree which satisfy maxheap property, each of size ‘n’. What is the time complexity to combine both M1 and M2 such that combine tree will be min heap tree? O (n log n) O (n) O (n2) O (n2 log n)
asked
Dec 6, 2016
in
DS
by
Vishal Goyal
Active
(
1.8k
points)

335
views
madeeasytestseries
datastructure
heap
timecomplexity
0
votes
1
answer
16
Self Made
Suppose we are given a set of elements to be inserted in a Max Heap. What is the approach to follow from the following? 1.Insert an element, apply HEAPIFY, insert the next element, again apply HEAPIFY, and so on. 2. Insert all the elements and once done, apply BUILDMAXHEAP. What is the correct approach?
asked
Dec 3, 2016
in
DS
by
Samujjal Das
Loyal
(
9.3k
points)

68
views
heap
+14
votes
1
answer
17
GATE200677
Statement for Linked Answer Questions 76 & 77: A $3$ary max heap is like a binary max heap, but instead of $2$ children, nodes have $3$ children. A $3$ary heap can be represented by an array as follows: The root is stored in the first location, $a[0]$, nodes in the next level, from left to right, is ... $10, 9, 4, 5, 7, 6, 8, 2, 1, 3$ $10, 8, 6, 9, 7, 2, 3, 4, 1, 5$
asked
Nov 27, 2016
in
DS
by
Arjun
Veteran
(
424k
points)

1.3k
views
gate2006
datastructure
heap
normal
+5
votes
1
answer
18
GATE19902viii
Match the pairs in the following questions: ...
asked
Nov 19, 2016
in
DS
by
makhdoom ghaya
Boss
(
30.1k
points)

803
views
gate1990
matchthefollowing
datastructure
heap
+7
votes
2
answers
19
Space complexity of heap sort
Why space complexity of heapsort is O(1)....and why not O(logn)..because of space required by recursion calls which is equivalent to height of the tree...where am i getting wrong plz help...
asked
Nov 7, 2016
in
Algorithms
by
vineet.ildm
Active
(
1.1k
points)

1.2k
views
algorithms
timecomplexity
spacecomplexity
sorting
heap
+4
votes
2
answers
20
Heaps
asked
Oct 26, 2016
in
Algorithms
by
jenny101
Active
(
1.1k
points)

493
views
heap
algorithms
datastructure
+4
votes
1
answer
21
Max heap
A level of a max heap (containing 100 nos) is choosen randomly, on its selection, a node from the same level is choosen randomly. What is the probability that it is the 36th smallest element
asked
Oct 7, 2016
in
Algorithms
by
vivek9837
Junior
(
835
points)

456
views
heap
algorithms
probability
+3
votes
1
answer
22
Binary Max Heap
In a binary max heap containing n numbers, the smallest element can be found in time?
asked
Sep 13, 2016
in
DS
by
Hardik Vagadia
(
339
points)

461
views
binaryheap
heap
+6
votes
3
answers
23
7th smallest element in a MinHeap
In a minheap with n elements 1). The 7th smallest element can be found in time, if duplicates are allowed ? 2). The 7th distinct smallest element can be found in time, If duplicates are allowed ?
asked
Sep 4, 2016
in
Algorithms
by
Kapil
Veteran
(
50.6k
points)

1.4k
views
algorithms
heap
binaryheap
sorting
timecomplexity
+1
vote
2
answers
24
UGCNETJune2011II25
When the priority queue is represented by max heap, the insertion and deletion of an element can be performed in (queue containing $n$ elements) $\theta(n)$ and $\theta(1)$ respectively $\theta(n)$ and $\theta(n)$ respectively $\theta(1)$ and $\theta(1)$ respectively None of the above
asked
Aug 25, 2016
in
Others
by
makhdoom ghaya
Boss
(
30.1k
points)

816
views
ugcnetjune2011ii
datastructure
queue
heap
+3
votes
2
answers
25
UGCNETJune2015III36
The number of nodes in height h in any nelement heap is $h$ $z^h$ ceil $\biggl(\frac{n}{z^h} \biggr)$ ceil $\biggl(\frac{n}{z^{h+1}} \biggr)$
asked
Aug 1, 2016
in
Others
by
jothee
Veteran
(
105k
points)

621
views
ugcnetjune2015iii
datastructure
heap
+1
vote
1
answer
26
heap sort
The number of elements that can be sorted in time using heap sort ?
asked
Jul 30, 2016
in
Algorithms
by
reena_kandari
Loyal
(
8.1k
points)

424
views
algorithms
timecomplexity
sorting
heapsort
heap
0
votes
1
answer
27
UGCNETJune2013III13
In any nelement heap, the number of nodes of height h is, less than equal to $\biggl[ \frac{n}{2^h} \biggr]$ greater than $\biggl[ \frac{n}{2^h} \biggl]$ greater than $\biggl[ \frac{n}{2^h+1} \biggr]$ less than equal to $\biggl [ \frac{n}{2^h+1} \biggr]$
asked
Jul 16, 2016
in
Others
by
jothee
Veteran
(
105k
points)

316
views
ugcnetjune2013iii
datastructure
heap
+1
vote
1
answer
28
UGCNETDec2012III51
Suppose there are $\log_n$ sorted lists of n $\log_n$ element each. The time complexity of producing a sorted list of all these elements is (use heap data structure) $O (n \log \log_n)$ $\theta (n \log_n)$ $\Omega (n \log_n)$ $\Omega (n^{3/2})$
asked
Jul 13, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

501
views
ugcnetdec2012iii
algorithms
timecomplexity
heap
Page:
« prev
1
2
3
4
5
next »
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
REGARDING ISRO TEST SERIES BY MADEESASY
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
Follow @csegate
Recent questions tagged heap
Recent Blog Comments
i also don't have any pdf, actually, I added the...
i don't have , if you have upload it
@mohan123 Do you have all standard book...
bro can be upload all standard book questions in...
it'll take 34 days but for most purpose you can...
50,647
questions
56,459
answers
195,377
comments
100,271
users