Consider two max-heaps A and B, where A heap-size - 100, B.heap-size - n, and n is asymptoticall large, thus n > 100. Which of the following is the most efficient way to merge the two max-heaps? O Default O Insert the elements of A into the max-heap B. O Insert the elements of B into the max-heap A. O Copy the elements of A and B into an array C, then call BUILD-MAX-HEAPIC).

Consider two max-heaps A and B, where A heap-size - 100, B.heap-size - n, and n is asymptoticall large, thus n > 100. Which of the following is the most efficient way to merge the two max-heaps? O Default O Insert the elements of A into the max-heap B. O Insert the elements of B into the max-heap A. O Copy the elements of A and B into an array C, then call BUILD-MAX-HEAPIC).

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

**In JAVA please** Construct a Binary HEAP for 5000 random ints numbers which are between 0 and 50000. These numbers need to be generated by a random function. Construct Binary HEAP by inserting(using Insert()) the input elements one at a time, into an initially empty binary heap using insert operation. (This should be a different method from the "linear-time algorithm" to build a heap)
4. Draw a new heap that is created by inserting 52 into the following heap: 100 71 67 68 50 44 51 60 49 25 30
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)
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
Give the array that results immediately after completing the first phase of heapsort (heap construction) on the following array of 10 keys: 7 4 2 3 5 8 1690 Your answer should be a heap. Enter you answer as a sequence of numbers separated by a single space. Do not put spaces at the beginning or the end of your answer. Do not include any punctuation!
Q1. Implement in Java the greedy algorithm for giving change with minimum number of coins: while (more coin-sizes && change
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
3. Build a heap for the given array 90 35 82 3 24 15 79. What will be the new array that represents the heap? • Assume the resulting array A=abcdefg o a= o b= O C= od= o e= 0 f= og= 4. Show the result of the following example where the key of root node A[ 0 ] is decreased to 1 from 10. 10 7 HH -- 5 Show Transcribed Text Initial array: A[1] 10 o 8 |---|---| 4 6 What will the resulting array look like? • Assume the resulting array A = a b c d e f g a = o b= 0 C= d= o e= of= • g = --> changed to 1 A[2] A[3] 7 8 A[4] A[5] 3 5 A[6] 4 A[7] 6
Write the array that represents the binary max-heap of the following input array and satisfied the max-heap properties: 3 5 17 6 9 8 2 Please the answer should be like sequence numbers with commas separated the first number represents the first index etc. For example: 5, 6, 7, 3, 9, 1, 8, 2 Answer
for the following sequence of keys, do the following: MBX, EXB, GBX,…, ABX, AXB,…, QXB, YXB, … . 3. Build a max- Heap showing all steps in details.
4. Create the binary heap (a max heap) from the following list of numbers (input from left-to-right). Make sure to show all intermediate steps. 2 3 4 5 6 7 8 9 1 10
Construct a max heap using the BUILD-MAX-HEAP procedure from the input array H = {1, 3, 5, 7, 15, 11, 13, 9). After building the max heap, answer the following questions. Numeric answers must be encoded as Arabic numbers. For example, if the answer is 5 you should encode the number 5 (not the word "five"). If the answer is none, write none. 1. What is the root node of the resulting max heap? 2. What is the left child of node 7? 3. What is the right child of node 9? 4. What is the left child of node 13? 5. What is the parent of node 1?