1. Heap and Heapsort. (a) Run Build-Heap on the array [10,9,4,7,6, 2, 3, 1, 8, 5] to construct a min heap. Write down the resulting array. Then, run the loop in Heapsort for three iterations. For each iteration write down the array after Heapify-Down is finished. You do not need to show intermediate steps. (b) Show that the leaves of a heap occupy the positions [],...,n- 1 of the array. (c) In the procedure Build-Heap, why do we decrease i from [2]-1 to 0 instead of increasing from 0 to []-1? Give an example array where increasing i fails to create a valid min heap.

1. Heap and Heapsort. (a) Run Build-Heap on the array [10,9,4,7,6, 2, 3, 1, 8, 5] to construct a min heap. Write down the resulting array. Then, run the loop in Heapsort for three iterations. For each iteration write down the array after Heapify-Down is finished. You do not need to show intermediate steps. (b) Show that the leaves of a heap occupy the positions [],...,n- 1 of the array. (c) In the procedure Build-Heap, why do we decrease i from [2]-1 to 0 instead of increasing from 0 to []-1? Give an example array where increasing i fails to create a valid min heap.

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

7. Show the steps of HEAP SORT for the following array of elements in ascending order. W E A R Y
Please don't copy the solution. Assignment: For this week’s assignment, you’re going to be creating a Heap Sorter. It should be able to take input (using CIN), place it into proper Max Heap form in an array, and once it’s done accepting input, put the array in order using a Heap Sort. For the sake of simplicity, our heap trees will be made of an array that’s only seven elements long. Make sure to define your arrays ahead of time with garbage filler data before you start putting in your CIN data. Remember to use the binary heap traversal trick when dealing with your array-based tree. Please sort the following lists of inputs: 1.) 12, 40, 2, 6, 88, 90, 5 2.) 1, 2, 3, 4, 5, 6, 7 3.) 7, 6, 5, 4, 3, 2, 1 4.) 42, 64, 355, 113, 101, 13, 35 5.) 12, -5, 24, -4, 48, -3, 96
2.) C [10] = {5, 1,2,8,6,10,3,9,4,7} heap size = 10 Do Heapify (C, 1). What the values in the array C starting from the index 0 to 9?
C++ PROGRAMMING: HEAPS Using the array-based implementation, complete the heap ADT in the arrayheap.h. void insert(int num) This will insert the num to the heap. This number shall be initially added in the last position and will constantly be compared to its parent and get swapped if the parent is greater. int removeMin() This will remove the root by it being replaced by the last position. Remember to store it to some temporary variable first and return it later. The replaced number will also have to be constantly compared to its children and swapped by the smaller element if it is smaller than the number. int size() This will simply return the number of elements currently in the heap. Given that this is an array, it must also be dynamic. If the array is full when attempting to add an element, increase the capacity of the memory by 50% (rounded up). For instance, the array of capacity 4 is already of size 4, we add 4 * 50% = 2 when we try to add an element. And so, the array…
Push 13 to the following min-heap and write the resulting heap array in the answer space. Write the array like a normal C++ array (e.g.: {67, 54, 123, ...}). 54 51 62 27 59 12pt ✓ Paragraph 28 ⠀ 50 Edit View Insert Format Tools Table 3 44 22 24
You're given an array A[1...7] Heap-Insert(A, 8), what is the resulting A? (9, 7, 6, 4, 1, 5, 3). If you execute Max-
4. Build a Max-Heap on the following array A= Show all the steps.
QUESTION 3: Apply heap sort on the following array: show all work. 18 13 11 7 14 10 4 12 5
Show the array and heap after each step: 1. Add the following: 9 18 37 6 5 2 10 4 2. Remove the following: 10, 6
(b) Now consider storing a heap as a linked list with pointers. Give pseudo-code on how you would store a heap node, and which modifications you need to make to the heap routines that we discussed in class. What are the runtimes of the heap routines?
char ** doubleIt (char **arr, int *maxsize); The doubleIt function will increase the heap size by doubling the original space. The functions takes 2 arguments: 1. A double pointer of type char called arr. This is a 2D dynamic array that contains words (strings) from the respective category (noun, verb, adjective, preposition). This is the original heap. 2. A pointer of type int called maxsize. This pointer holds the address of an integer that keeps track of the maximum amount of strings the 2D dynamic array can store. When this function is invoked, the current size of the dynamic array is at capacity so the values should match. This value will need to be multiplied by 2. The function allocates a new heap that is twice the size of the original heap and copy the values from the original heap into the new heap. One important note about this is that you have to properly copy the values over in order to avoid segmentation fault. Think about how this can be avoided. That is part of the…
Suppose you want to use Heapsort to sort the contents of the following array in alphabetical order: [C; A; G; B; D; F; E]. Show the array's contents after the heapBuild method has been performed, i.e. when the array represents a heap