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

Q.No.3 a) Which array out of A, B and C represents a 0 1 2 9 10 11 binary heap? Only one answer is right. A-1 12 23 10 15 | 38 45 15 18| 20|21 0 1 2 3 4 5 7 8 9 10 11 b) Write the heap out as a binary tree. B= 18 27 10 45 | 83 91 31 12 52 51 c) Add last 2 digit of your arid no(44). to the 0 1 2 3 4 7 8 9 10 11 heap, making sure to restore the heap C=|1 13 20 21| 65 54 67 41 30 83 52 invariant. How does the array look 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

3. Sort the array A= [10, 15, 11, 12, 6, 28, 19] by using the operation (insertion and deletion) of Heapsort.
course name : analysis alogrithm
Question 6 0.5 points Save What would be the asymptotic time complexity to remove a node at the end of singly linked list, if the header is initially pointing to the first node of the list? o O(n2) O(n) O(log n) O(1) o o o O
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?
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
23 34 56 6 18 8910 urite lcode) the given mpeap abo above minhedp 3. 456 19 12 10 6 5 43 write Cco de) as a visuali 2ation of a tree, Tip :you may Use stringBullder CIuss and a program that prints the aboue max heap the String format () method ,Cuse Java) output Use 19 12 10 6. 4 3.
Answer on paper please
Please help me with this
In Part c take 04 and 09 as last 2 digit
Q.No.3 a) Which array out of A, B and C represents a 01 2 8 9 10 11 binary heap? Only one answer is right. A. 1 12 23 10 15 38|45| 15 18 20 21 3 4 $ 6 7 8 9 1011 b) Write the heap out as a binary tree. c) Add last 2 digit of your arid no. to the heap, B- 18 27 10 45 83 91 31 12 52 51 2 4 5 7 8 9 10 11 making sure to restore the heap invariant. C: 1 13 20 21 65 54 67 41 30 83 52 How does the array look now?
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