1. We can build a heap by repeatedly calling MAX-HEAP-INSERT to insert the ele- ments into the heap. Consider the following variation on the BUILD-MAX-HEAP procedure: BUILD MAX HEAP' (A) 1 A. heap_size=1 2 for i=2 to A. length 3 MAX HEAP INSERT (A, A[i]) (a) (10 points) Do the procedures BUILD-MAX-HEAP and BUILD-MAX-HEAP' always create the same heap when run on the same input array? Prove that they do, or provide a counterexample. (b) (10 points) Show that in the worst case, BUILD-MAX-HEAP' requires (nlgn) time to build an n-element heap.

1. We can build a heap by repeatedly calling MAX-HEAP-INSERT to insert the ele- ments into the heap. Consider the following variation on the BUILD-MAX-HEAP procedure: BUILD MAX HEAP' (A) 1 A. heap_size=1 2 for i=2 to A. length 3 MAX HEAP INSERT (A, A[i]) (a) (10 points) Do the procedures BUILD-MAX-HEAP and BUILD-MAX-HEAP' always create the same heap when run on the same input array? Prove that they do, or provide a counterexample. (b) (10 points) Show that in the worst case, BUILD-MAX-HEAP' requires (nlgn) time to build an n-element 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

explain
Given a BST, which traversal method would allow you to turn it into a min heap using N heap insertions calls in O(N) worst case runtime? Draw an example of this process. First, draw a BST with 4 nodes and height of 3. You can pick the integer values in your BST. Then show the resulting traversal order, and a drawing of the values inserted into a min heap using N heap insertions. Redraw the heap after each insertion.
2.a. Add a node with value 3 to the following min heap. Show the upheap swap process needed to restore the heap-order property. You will need at least three diagrams. Thanks to https://www.cs.cmu.edu/~adamchik/15-121/lectures/Binary%20Heaps/heaps.html You are welcome to use Microsoft Paint (type "mspaint" in the start menu search box) to create several diagrams. Alternatively, use pen and paper, or a whiteboard, and take a picture with your cell phone. 2.b. Remove the root node from the following heap. You will need to downheap swap to restore the heap-order property. Use diagrams to show the state of the heap at each step. You will need at least three diagrams. Thanks to http://www.studytonight.com/data-structures/heap-sort
For a given heap below: M (K A F H. The array representation of the heap is givep below. 1 2 3 4 Y W M 15 K 11 H. 6. 10 12 F a) Delete the root node, give the resulting heap. 3 1 2 4 6 10 11 12 b) Insert Q into the original heap, give the resulting heap. 3 12 4 16 10 11 12 TTTT Paragraph E- E T Arial 3 (12pt) T T. OS. Mashups HTML CSS O Type here to search
What does the initially empty max-heap h contain after the following sequence of pseudo-code operations? Show at least 5 binary heaps as stated in Figure 1 to show the changes after a sequence of heap operations.
Please help me write a pyhon code for this problem
2
Algorithm Demonstrate, step by step, how to construct a max-heap for the list of integers A[1..8] = (12, 8, 15, 5, 6, 14, 1, 10) (in the given order), following Example 4.14.
Question 1 aa Please try to give the answer within 40 mins. Thank you. Full explain this question I give you thum
how to implement this function using min heap functions.(c++) void dijkstra(char startVertex, char* prev, Node distances[] );//find the shortest path from the start vertex to all other vertices, by filling the prev array and the distances array
use figure 6.5 to answer the question
Please answer ASAP The insert function below is used to insert item into the priority queue and maintaining the heap order property. (Note: isFull and Overflow functions are defined elsewhere and work properly) Explain what are lines 1 to line 4 doing. template void BinaryHeap::insert(const Comparable & x) { if (isFull()) throw Overflow(); int hole = ++currentSize; // line 1 for ( ;hole > 1 && x < array[hole/2]; hole /= 2) // line 2 array[hole] = array[hole/2]; // line 3 array[hole] = x; // line 4 }