Course : Data Structures & Algorithms in C++ Questiona) Which array out of A, B and C represents0 1 29 10 11478a binary heap? Only one answer is right.A=1 12 23 10 15 38 45 15 18 20 2123.47.9.10 11b) Write the heap out as a binary tree.B=18 27 10 45 83 91 31 12 52 51c) Add 25 to the heap, making sure to17 8 923410 11restore the heap invariant. How does theC=1 13 20 21 65 54 67 41 30 83 52array look now?

1) Array B represents a Binary Heap. So the correct answer is B 2)min-heap property was…

Question a) Which array out of A, B and C represents 7 9 10 11 a 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. 01 2 3 4S 6 7 8 9 10 11 c) Add 25 to the heap, making sure to B-18 27 10 45 83 91 31 12 52 51 0 1 2 3456 7 9 10 11 restore the heap invariant. How does the C- 1 13 20 21 65 54 67 41 30 83 52 array look now? on

Question a) Which array out of A, B and C represents 7 9 10 11 a 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. 01 2 3 4S 6 7 8 9 10 11 c) Add 25 to the heap, making sure to B-18 27 10 45 83 91 31 12 52 51 0 1 2 3456 7 9 10 11 restore the heap invariant. How does the C- 1 13 20 21 65 54 67 41 30 83 52 array look now? on

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

Q.No.3 a) Which array out of A, B and C represents a 0 1 2 3 4 56 7 8 9 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 567 8 9 10 11 c) Add last 2 digit of your arid no(Take 7 and B= 18 27 10 45 | 83 91 31 12 52 51 0 1 2 3 8 9 10 11 2). to the heap, making sure to restore the C: 1 13 20 21 65 54 67 41 30 83 52 heap invariant. How does the array look now?
Q.No.3 a) Which array out of A, B and C represents a 0 1 2 3 4 5 6 7 8 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 8 9 10 11 5 6. 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 5 6. 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?
a) Which array out of A, B and C represents a 3 4 5 6 7 8 9 10 11 012 binary heap? Only one answer is right. A. 1 12 23 10 15 38 45 15 18 20 21 0 1 2 3 8 9 10 11 4 b) Write the heap out as a binary tree. B- 18 27 10 45 83 91 31 12 52 51 c) Add 59 to the heap, making sure to restore the heap invariant. How does the array look 2 3 4 5 6 7 8 9 10 11 c.1 13 20 21 65 54 67 41 30 83 52 now?
Q.No.3 0 1 2 9 10 11 3 a) Which array out of A, B and C represents a 4 A =|1 12 23 10| 15 38 45 15 18 20 21 binary heap? Only one answer is right. 0 1 2 8 9 10 11 3 4 6 7 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 nol 67). to the 0 1 2 3 8 9 10 11 4 6 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 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?
Q.No.3 012 3 4 56 7 8 9 10 11 A. 1 12 23 10 15 38|45| 15 18 20 21 a) Which array out of A, B and C represents a binary heap? Only one answer is right. 3 9 10 11 b) Write the heap out as a binary tree. B= 18 27 10 45 83 91 31 12 52 51 01 2 3 45 6 7 8 9 10 1 C: 1 13 20 21 65 54 67 41 30 83 52 c) Add last 2 digit of your arid no (Take 4 and 9). to the heap, making sure to restore the heap invariant. 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
2 3 456 19 12 1065 3 write Cco de) a prog ram that prints the aboue max heap as a Visuali 2aton Of a tree, TiP you may Use stringBullder CluS5 and the String format() method, output 19 12 10 6. 4 3.
Object is name(age,time) For example : apple (1,11) the Binary tree order depend on age Write a java code that would add a new node to the tree in the leaf position where binary search determines a node for d should be inserted. To build fix the trees so that the properties of the max heap are maintained (i.e. the parent node must have higher adoption priority than its children). This means that we need to perform upheap if needed. Note that since this is also a binary search tree, we need to make sure that when performing upheap we don’t break the properties of the binary search tree. To ensure this, instead of performing upheap as seen in class, we will need to implement a tree rotation that reverses the parent-child relationship whenever necessary. Depending if the child that has to be swap in the parent position is the left or the right child, we will need to perform a right rotation or a left rotation
Given the following heap array, assuming heap entries start at index 1, draw the corresponding binary tree. 0. 1. 12 4 7. 8. 75 17 68 10 3. 32 40 1. 2. 69. 32 10 3. 4. 75 5. 3.
Q2: Draw depending on this Binary Heap which called R. 1. Can you find where is the last and the next node? Draw IN BOTH WAYS (Explicit & Implicit). 2. Find-min(R). 3. Insert(R, 4)
Q2: Heaps a) How would the following minheap be updated if we add the following numbers (read in sequence from left to right). 10, 8, 5, 8 0018 0000 0014 DOOT 0012 b) How would the above heap tree be changed when we remove the minimum?