Q.No.3a) Which array out of A, B and C represents a01 28 9 10 11binary heap? Only one answer is right.A. 1 12 23 10 15 38|45| 15 18 20 213 4 $ 67 8 9 1011b) 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 512457 8 9 10 11making sure to restore the heap invariant.C: 1 13 20 21 65 54 67 41 30 83 52How does the array look now?

The binary heap is a sorting method in which it is either a minimum heap or a maximum heap. In the…

a) Which array out of A, B and C represents a 01 23 45 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 2. 4 6. 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 0 1 2 3 4 s 6789 10 11 c) Add last 2 digit of your arid no. to the heap, 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?

a) Which array out of A, B and C represents a 01 23 45 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 2. 4 6. 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 0 1 2 3 4 s 6789 10 11 c) Add last 2 digit of your arid no. to the heap, 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?

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 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?
10. What is the worst case time complexity of performing the heap sort on an array with n elements? A. O(n²) B. O(n) C. O(nlogn) D. O(logn) E. None of the above
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?
Write the full Java code for NaturalMergeSorter.java
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.
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
You're given an array A[1...7] Heap-Insert(A, 8), what is the resulting A? (9, 7, 6, 4, 1, 5, 3). If you execute Max-
Execute this code with THREE pushes and ONE pop: stack s; s.push (1); s.push (2); s.push (3); s.pop ( ); Suppose that s is represented by a partially filled array. Draw the state of the private member variables of s after the above code: used| data| [0] (1] [2] [3] [4]
In Part c take 04 and 09 as last 2 digit
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]