Suppose we want to use the Heapsort algorithm to sort a large list of numbers. Our first step is to convert the input list to a heap, and then run BUILD-MAX-HEAP, which applies MAX-HEAPIFY on all the nodes in the heap, starting at the bottom and moving towards the top. (Think about why we do it bottom-up instead of top-down.) An example is provided on pg. 157 of the textbook. In this example, A = [4,1,3,2,16,9,10,14,8,7]. The end result of BUILD- MAX-HEAP is [16,14,10,8,7,9,3,2,4,1]. I strongly encourage you to go through this example, step by step. A total of 7 swaps are made by BUILD-MAX-HEAP. You can check that the seven swaps occur in this order: (14,2), (10,3), (16,1), (7,1), (16,4), (14,4), (8,4). Here is another way to see this: 2 goes down one level, 3 goes down one level, 1 goes down two levels, and 4 goes down three levels. Adding the underlined numbers, we see that the total number of swaps is 1+1+2+3 = 7. %3D Suppose A = [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15]. Determine BUILD-MAX-HEAP(A), and also determine the total number of swaps.

Suppose we want to use the Heapsort algorithm to sort a large list of numbers. Our first step is to convert the input list to a heap, and then run BUILD-MAX-HEAP, which applies MAX-HEAPIFY on all the nodes in the heap, starting at the bottom and moving towards the top. (Think about why we do it bottom-up instead of top-down.) An example is provided on pg. 157 of the textbook. In this example, A = [4,1,3,2,16,9,10,14,8,7]. The end result of BUILD- MAX-HEAP is [16,14,10,8,7,9,3,2,4,1]. I strongly encourage you to go through this example, step by step. A total of 7 swaps are made by BUILD-MAX-HEAP. You can check that the seven swaps occur in this order: (14,2), (10,3), (16,1), (7,1), (16,4), (14,4), (8,4). Here is another way to see this: 2 goes down one level, 3 goes down one level, 1 goes down two levels, and 4 goes down three levels. Adding the underlined numbers, we see that the total number of swaps is 1+1+2+3 = 7. %3D Suppose A = [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15]. Determine BUILD-MAX-HEAP(A), and also determine the total number of swaps.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Create a more efficient HeapVector that just keeps its values in order when necessary: When values are added to the heap, they are appended to the end of the existing heap and the nonHeap flag is set to true. When values are removed, the nonHeap flag is checked, and the Vector, if necessary, is heapified. What are the worst-case and best-case add and delete operation times?
Write a program to Construct a heap containing the items 10, 2, 9, 16, 8, 6, 1, 3, 12. You are to draw the heap (as a binary tree) at each of the major steps in the construction. (a) Inserting the items in the order given into an empty heap. (b) Building the heap fromthe bottomup, as in heapsort.
Write a procedure that, given parameters A, n, and i, where A is the array representation of an n-element heap, and 1 ≤ i ≤ n, deletes the element A[i] from the heap in O(log n) tim e.
Suppose we have to do m inserts and n deletions, starting from an empty heap. When would it be more beneficial to use a d-heap rather than a binary heap?
What is the minimum number of items that must be exchanged during a remove the maximum operation in a heap of size N with no duplicate keys? Give a heapof size 15 for which the minimum is achieved. Answer the same questions for two andthree successive remove the maximum operations
Suppose we use a 0-based array h[] to implement a heap of 200 elements. If an element of the heap is stored in h[71], the parent of this element can be found at h[]? Suppose we use a 0-based array h[] to implement a heap of 200 elements. If an element of the heap is stored in h[71], the left child of this element can be found at h[]? Suppose we use a 0-based array h[] to implement a heap of 200 elements. If an element of the heap is stored in h[71], the right child of this element can be found at h[]?
Create a programme to build a heap with the items 10, 2, 9, 16, 8, 6, 1, and 3 in it. At each of the crucial points in the creation process, you must depict the heap (as a binary tree). (A) Placing the things into an empty heap in the prescribed sequence. (b) As in heapsort, building the heap from the bottom up.
We can build a heap by top-down (iterated insertion), or by bottom-up. Given the numbers 10, 9, 12, 13, 14, 8 a. run the bottom-up algorithm to create a heap and show the resulting heap and ALLsteps b. run the top-down algorithm to create heap and show the resulting heap and ALLsteps
Heap Given a maxheap (keeps the largest value at the root), which has 4 functions push(h,v), v<-pop(h), new(h), and b<-isNotEmpty(h), where h is a heap, v is the value pushed/popped on the heap, new creates a new empty heap, isNotEmpty tests the heap, and b is a Boolean. What will the pseudocode below print? new(h); push(h, 10); push(h, 200); push(h, 0); push(h, 999); push(h, 5); while (isNotEmpty(h)) do {print(pop(h),” “);} print(“\n”);
Can we use heaps as priority queues? How so? Write an explanation, with the help of pseudocode/diagrams to support your explanation. Given a max heap, is there a way to use the max heap as a min heap, without writing a whole min heap implementation? Is the opposite also true? Justify your answer with pseudocode, and/or python OR java code, and explain your answer.
Demonstrate, step by step, how to sort a list of integers (2, 4, 1, 5, 6, 7) using a max-heap, following Example 4.15.
Suppose you are given the min heap [3, 5, 7, 22, 8]. You then push (4) onto the heap. What is its (4’s) index in the new heap? a. 5 b. 0 c. 2 d. 1