a) Which array out of A, B and C represents a3 4 5 6 7 8 9 10 11012binary heap? Only one answer is right.A. 1 12 23 10 15 38 45 15 18 20 210 1 238 9 10 114b) Write the heap out as a binary tree.B- 18 27 10 45 83 91 31 12 52 51c) Add 59 to the heap, making sure to restorethe heap invariant. How does the array look2 345678 9 1011c.1 13 20 21 65 54 67 41 30 83 52now?

a. The array B represents the binary heap. The array B can be represented using a binary heap. Array…

a) Which array out of A, B and C represents a 0 1 2 10 11 binary heap? Only one answer is right. 1 12 23 10 15 38 45 15 18 20 21 01 2 3 4 5 7 8 9 1011 b) Write the heap out as a binary tree. c) Add 59 to the heap, making sure to restore |1|8|27| 10 45 83 91 31 12 52 51 the heap invariantį How does the array look 3 4 5 6 7 $9 10 11 c. 1 13 20 21 65 |54 67 41 30 83 52 now?

a) Which array out of A, B and C represents a 0 1 2 10 11 binary heap? Only one answer is right. 1 12 23 10 15 38 45 15 18 20 21 01 2 3 4 5 7 8 9 1011 b) Write the heap out as a binary tree. c) Add 59 to the heap, making sure to restore |1|8|27| 10 45 83 91 31 12 52 51 the heap invariantį How does the array look 3 4 5 6 7 $9 10 11 c. 1 13 20 21 65 |54 67 41 30 83 52 now?

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

Given the binary minimum heap below, what does the heap look like after removing the root? 12 / 58 1 37 24 1 . 79 54 49 IMPORTANT: The penalty scheme for this question is 0, 50, 100%. Answer: (penalty regime: 0, 50, 100 %) Help Clear Check
Show the array's contents after the heapBuild method has been performed, i.e. when the array represents a heap. Fill in only one letter in each space. [ ] [Hint: think whether you need a max or a min heap to sort in alphabetical order]
Implement a double-ended queue. It is a variation where enqueues and dequeues are allowed on both ends. Implement the following double-ended queue operations using circular array representation with variables for the front and rear indices: a. new b. clear c. enqueueFront d. enqueueRear e. dequeueFront f. dequeueRear g. isEmpty h. isFull i. peek
PP 12.4 The array implementation in this chapter keeps the top variablepointing to the next array position above the actual top of thestack. Rewrite the array implementation such that stack[top] isthe actual top of the stack. PP 12.5 There is a data structure called a drop-out stack that behaves likea stack in every respect except that if the stack size is n, whenthe n + 1 element is pushed, the first element is lost. Implement adrop-out stack using an array. (Hint: A circular array implementation would make sense.)
4. A feature of binary search tree is that duplicate values are discarded when insertions are made into the tree. This is referred to as duplicate elimination. Write a program that produces 20 random numbers between 1 and 20. The program should store all nonduplicate values in an array. Use the smallest possible array to accomplish this task.
Build a heap from the following array. Show the heap after ???????() occurred at each node. ? = [3, 5, 1, 6, 2, 0, 8, 11, 9] Perform 2 rounds of sorting (i.e., sort two largest numbers) using ????????() procedure. Show the heap and array after every round.
In class we turned normal arrays into heaps. We called this operation heapify. Given the following array of numbers; show the final heap and the final corresponding array resulting from our heapify operation. Show all work. 5, 9, 8, 13, 7, 15, 2
Q.No.3 a) Which array out of A, B and C represents a 0 1 2 3 4 10 11 binary heap? Only one answer is right. A. 1 12 23 10 15 38 45 15 18 20 21 b) Write the heap out as a binary tree. 0 1 2 3 4 5 7 8 9 10 11 91 c) Add last 2 digit of your arid no(Take 7 and B- 18 27 10 45 83 91 31 12 52 51 2). to the heap, making sure to restore the 1 2 3 4 5 7. 6. 10 11 C. 1 13 20 21 65 54 67 41 30 83 52 heap invariant. How does the array look now?
a. What is the key value of the left child of 88? b.What is the key value of the right child of 88? c. Start with the original max-Heap. What is the key of the left child of the root (element 0 of the vector) after a pop() operation?
**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)
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.
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