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 a heap, the parent of a node n is _________ a ceil(n/2) b 2n c n-1 d floor(n/2)
Question 16 Remove two entries from the following heap what will be the new heap? O O O 1 7 4 3 3 3 4 9 3 8 7 7 6 6 6 10 4 3 4 3 4 2 8 8 8 8 8 6 5 2 2 2 5 6 6 7 7 7 2 5 5 5 2
9. Sort. I need as soon as possible
Question Give the sequence of the 13 keys in the array that results after inserting the sequence of 3 keys 75 31 40 into the following maximum-oriented binary heap of size 10: 93 82 77 16 59 20 69 11 13 41 Answer Your answer should be a sequence of 13 integers, separated by whitespace.
4. Build a Max-Heap on the following array A= Show all the steps.
Please help me with this
A min-heap is useful when we are interested in the minimum value of aset of numbers. Now, instead of the min, we are interested in the K-th smallest value. a.) ) Please design a data structure to allow the following two operations: push (insert a newnumber) and find_Kmin (return the value of the K-th smallest number without removing it). Bothoperations should be done in O(log K) time. b.) In addition to push and find_Kmin, now we also want to support the pop operation toreturn and remove the K-th smallest element. Please design a data structure to support these threeoperations, and each operation should take O(log n) time with n being the size of the current set.
Consider implementing heaps by using arrays, which one of the following array represents a heap? O a. [30,26,12,23,10,8] O b. [8,12,13,14,11,16] O. [30,26,12,13,10,18] O d. [18,12,13,10,11,16] Which of the following is wrong, after each iteration of quick sorting? a. None of the other answers O b. Elements in one specific (e.g. left) portion are smaller than the selected pivot. C. Elements in one specific (e.g. right) portion are larger than the selected pivot. O d. The selected pivot is already in the right position in the final sorting order.
Choose the array below which correctly represents the backing store for the following min heap. 55 26 25 57 62 (67 96 63 O [0,14,26,25,96,67,63,55,57,62] O [0,14,26,96,67,25,63,55,57,62] O [96,26,67,14,63,25,0,null,57,null,55,62]] O [0,14,55,26,25,57,62,96,67,63]
What are the time complexities of the following operations in a max_heap containing m data? 1. a. Build the heap b. Extract the maximum key c. Insert a new key to the heap d. Sort an array using heap_sort method
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…
not handwritten