Assume that you are implementing a heap using a fixed size array. 1- Illustrate how the following heap would be constructed (show the content of the array, show in detail only what happens when nodes DOB and 17 are added): The nodes are inserted in the following order (key, value): (9, -4), (3, -6), (11, -4), (13, -7), (14, -2), (12, -8), (33-5), (17, -7), (6, -3). 2- Illustrate what happens to the heap when invoking remove (show the details). 3- Assume that you have an array of integers, write a code that would allow you to sort the array in ascending order (smallest to largest), using only a heap.

Assume that you are implementing a heap using a fixed size array. 1- Illustrate how the following heap would be constructed (show the content of the array, show in detail only what happens when nodes DOB and 17 are added): The nodes are inserted in the following order (key, value): (9, -4), (3, -6), (11, -4), (13, -7), (14, -2), (12, -8), (33-5), (17, -7), (6, -3). 2- Illustrate what happens to the heap when invoking remove (show the details). 3- Assume that you have an array of integers, write a code that would allow you to sort the array in ascending order (smallest to largest), using only a 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

2. Show the results of the following operations on an initially empty max heap: a. insert 2, 3, 4, 1, 9, one item at a time; b. delete one item from the heap; c. insert the item 7 and then the item 6; d. delete one item from the heap e. insert the item 5. [7] 3. Show the array presentation of tree that resulted from Question 2.
python This question is on heapsort. (a) We aim to construct a max heap based on an array A. When we call heapify(A,i) for i > size(A)/2, what will happen? (b) Assuming the elements in the array A are in a decreasing order, what is the running time of heapsort on A (using a max heap when constructing the heap)?
USING LANGUAGE C Implement a heap by inserting the following nodes in this order: 11, 5, 13, 3, 7, 6, 77, 1, 4, 222 ▪Print the heap after each insertion. ▪Dequeue each node and print each deleted node. ▪Your final output should be similar to the screen shot in the next slide
Question 16 Rk.Given a max-heap whose values correspond to the array indices from 1 through n,what is the smallest possible index for a node with height 1 in the heap? Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line
Assume X = {3,4,6,9,8,7,16,15,20,19} is an array representation of a binary heap can i have help with drawing a binary heap draw a binary heap
Assume that we have an array as shown in Figure 6. Show the heap made of this arraywhen we use the heap sort. Note that you need to show the final heap that is createdfrom the process. c++
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[]?
What exactly does the term heap mean? "It takes O(nlogn) time to perform a heap operation." - offer an appropriate illustration to explain the statement
Construct a Binary Heap using the following sequence of numbers as input. It is up to you to decide to construct a Max heap or Min heap. 28 12 17 5 7 22 13 12 4 11 16 Do all of the following. Write a Max_heapify or Min_heapify function, depending on your construction decision Write a Build_heap function using the given series of numbers. Write a Delete_root function to delete a root node from the heap. Write a print function to display the heap. (print all nodes which have the same level in one line)
Construct a dynamic max heap by inserting one integer at a time to the evolving max heap. Show all steps. Array: 7 30 33 10 44 38 3 1
1. Assume we build a binary max-on-top heap from keys 10, 12, 1, 14, 6, 5, 8, 15, 3, 9, 7, 4, 11, 13, 2. a. Show the result of building this heap by inserting the above keys one at a time in the order given (from left to right), into an initially empty binary heap. Please show key steps and short illustrations if necessary. b. Show the heap from problem (a) above after executing three deleteMaximum operations on this heap. Show each step. 2. Use the same key set given Q1, write a program to output the median using heap structure. The median is the value separating the higher half from the lower half of a data sample. For example, the median of input is 8. 3. Use the same input stream of Q1, implement HeapSort in ascending order.
Assume you are using a backtracking algorithm to search for the node 40 in the max heap represented by the array 100, 50, 60, 40, 10, 20, 30. Assuming that you search from the root of the heap downwards recursively, which of the following is a valid order in which the nodes could have been first visited? 30, 20, 10, 40 100, 50, 60, 10, 30, 40 100, 60, 30, 20, 50, 10, 40 100, 60, 50, 30, 20, 10, 40 100, 60, 30, 20, 10, 40 Assume you are using a backtracking algorithm to search for the node 40 in the max heap represented by the array 100, 50, 60, 40, 10, 20, 30. What is the minimum number of nodes that must be searched in order to find the node 30? 1 5 6 3 4 Assume you have the following backtracking algorithm for finding a way to a desired location in a city organized in a grid as represented by the image. What is the problem with this proposed algorithm? Bool SearchCity(currentLocation,, desiredLocation, stepsToLocation) { If(currentLocation == desiredLocation) { Return…