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

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Cormen Edition 3 Exercise 6.5 Question 3 (Page No. 165)
0
votes
12
views
Write pseudo code for the procedures HEAPMINIMUM, HEAPEXTRACTMIN, HEAPDECREASEKEY, and MINHEAPINSERT that implement a minpriority queue with a minheap.
cormen
algorithms
heap
descriptive
asked
Jun 27, 2019
in
Algorithms
by
akash.dinkar12

12
views
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
0
votes
0
answers
1
Cormen Edition 3 Exercise 6.5 Question 4 (Page No. 165)
Why do we bother setting the key of the inserted node to $\infty$ in line $2$ of MAXHEAPINSERT when the next thing we do is increase its key to the desired value?
asked
Jun 27, 2019
in
Algorithms
by
akash.dinkar12

51
views
cormen
algorithms
heap
descriptive
0
votes
0
answers
2
Cormen Edition 3 Exercise 6.5 Question 2 (Page No. 165)
HEAPINCREASEKEY(A,i,key) 1 if key < A[i] 2 error new key is smaller than current key 3 A[i] = key 4 while i > 1 and A[parent(i)] < A[i] 5 exchange A[i] with A[parent(i)] 6 i=parent(i) MAXHEAPINSERT(A,key) 1 A ... ,key) Illustrate the operation of MAXHEAPINSERT$(A,10)$ on the heap $A=\langle 15,13,9,5,12,8,7,4,0,6,2,1 \rangle$.
asked
Jun 27, 2019
in
Algorithms
by
akash.dinkar12

47
views
cormen
algorithms
heap
descriptive
0
votes
0
answers
3
Cormen Edition 3 Exercise 6.5 Question 9 (Page No. 166)
Give an $O(n\lg\ k)$ time algorithm to merge $k$ sorted lists into one sorted list, where $n$ is the total number of elements in all the input lists. (Hint: Use a minheap for $k$way merging.)
asked
Jun 27, 2019
in
Algorithms
by
akash.dinkar12

32
views
cormen
algorithms
heap
descriptive
0
votes
1
answer
4
Cormen Edition 3 Exercise 6.5 Question 8 (Page No. 166)
The operation HEAPDELETE$(A, i)$ deletes the item in node $i$ from heap $A$. Give an implementation of HEAPDELETE that runs in $O(lg\ n)$ time for an $n$element maxheap.
asked
Jun 27, 2019
in
Algorithms
by
akash.dinkar12

55
views
cormen
algorithms
heap
descriptive
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
IITD MS CSE (Systems) Experience
IIT Bombay M.Tech. (RA)  Interview Experience
Interview Experience for MS(R)IIT Delhi (School of Information Technology)
How am I preparing
PGEE 2020 (CSE) Experience
Subjects
All categories
General Aptitude
2k
Engineering Mathematics
8.2k
Digital Logic
2.9k
Programming and DS
5k
Algorithms
4.4k
Theory of Computation
6.2k
Compiler Design
2.2k
Operating System
4.6k
Databases
4.2k
CO and Architecture
3.4k
Computer Networks
4.2k
Non GATE
1.2k
Others
1.5k
Admissions
595
Exam Queries
562
Tier 1 Placement Questions
23
Job Queries
71
Projects
19
Unknown Category
1k
Recent Blog Comments
Very helpful. can't thank you enough! :) :)
@toxicdesire I don't remember the exact...
Will you please tell what they answered to your...
@commenter max marks for part A was 75. They did...
Hope you get selected bhaiya
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,345
questions
60,506
answers
201,910
comments
95,341
users