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

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

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 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?
3. Are the following arrays heaps? Why or why not? a. 95 77 43 66 64 25 44 11 10 47 b. 20 27 56 56 44 77 91 82 98 73
Data Structure/Operation Stack/Push Balanced Binary Search Tree/Delete Binary Heap/DeleteMin Hash Table/Find Vector/push_back Binary Heap/Insert Balanced Binary Search Tree/Delete Queue/pop Vector/Find Linked List/InsertAtHead Hash Table/Insert Average Complexity in Big-O 0 (1)
6. Draw a Binary Tree from the following array data and sort the resulting tree using Heap sort algorithm. 1 2 47 Index 10 11 3 52 4 7 8 12 13 Data 18 18 42 85 56 74 35 24 65 36 72
def sorting(x, i, j) if j+1-i < 10 then Mergesort(x, i, j); t1 = i + (j+1-i)/3 t2 = i + 2*(j+1-i)/3 Sorting(x, i, t2) Sorting(x, i, j) Sorting(x, i, t2) // x is an array, I and j are first and last indices of this part of the array // on k elements, takes O(k log k) time worst case analysis?
Suppose the following array were passed in to a mergesort algorithm: 42 39 87 21 56 93 43 35 and Draw what the array looks like after the first recursive call completes, then after the second recursive call (immediately before the final call to merge).
3. Sort the array A= [10, 15, 11, 12, 6, 28, 19] by using the operation (insertion and deletion) of Heapsort.
Question 1: Draw the Binary Search Tree (BST) that would result from the insertion of the following integer keys: 14 58 18 10 99 52 10 99 52 33 69 74 17 • Insert 21 into the resulting BST • Delete 52 from the BST Question 2: Build the Minheap for the following items in the array: 11 54 10 5 83906 • Insert 4 into the resulting Minheap Delete 5 from the resulting Minheap. Question 3: Given the following keys: 90 13 3 77 21 1 • Sort these items using bubble sort. Sort these items using selection sort. 1
Course: Data Structures and Al X Adatszerkezetek és algoritmus X b Home | bartleby https://elearning.unideb.hu/pluginfile.php/1073895/mod_resource/content/1/Lab07.pdf * TP J Adatszerkezetek és algoritmusok 42 / 43 143% + | 0 0 Execute the following operations with the Binary Search Tree: CREATE; INSERT(23); INSERT(18); INSERT(35); INSERT(73); INSERT(51); INSERT(31); INSERT(20); INSERT(32); INSERT(81); DELETE(23); INSERT(19); DELETE(35); DELETE(73); INSERT(63); DELETE(31); INSERT(71); INSERT(37); DELETE(18); II
3. Draw the binary heap in its tree form from its array form: 0 1 2 3 4 5 6 7 8 9 10 11 12 2 3 4 9 10 17 15 11 9 13 22 20
5d. Show the steps required to do a heap sort only for the first 5 values sorted using all values on the following set. (SHOW THE ARRAYS). Remember to use all values given below. 346 22 31 212 157 102 568 435 8 14 5
Linked lists and arrays are primitive data structures that are useful in implementing many complex data structures and algorithms. Assuming a doubly-linked list, which of the following algorithms will become slower (in terms of time complexity) if implemented with linked lists (in comparison to array implementation)? Select one: a. All of the above b. Insertion sort c. Merge sort d. Bubble sort e. Binary search