5. Answer the following questions about heaps: a. Give at least 3 differences between a Binary search tree and a Max heap (when viewed as a tree) b. Draw a tree that can be both a Min heap and a Max heap c. Is the array with the values [35, 17, 24, 6, 13, 9, 2, 5, 9, 12] a Max heap?

5. Answer the following questions about heaps: a. Give at least 3 differences between a Binary search tree and a Max heap (when viewed as a tree) b. Draw a tree that can be both a Min heap and a Max heap c. Is the array with the values [35, 17, 24, 6, 13, 9, 2, 5, 9, 12] a Max heap?

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

2. Bottom-Up Min-Heapify: For the following numbers, what is the resulting (1-indexed) heap after "heapifying" the input numbers (assume the input is an array/vector). Input: 9, 5, 2, 1, 4, 3, 6
2.) C [10] = {5, 1,2,8,6,10,3,9,4,7} heap size = 10 Do Heapify (C, 1). What the values in the array C starting from the index 0 to 9?
Q1. Bottom-Up Min-Heapify For the following numbers, what is the resulting (1-indexed) heap after "min-heapifying" the input numbers (assume the input is an array/vector) in the bottom-up, O(n), manner. Input 5,2,6,9,3,4,7 (5 is the root at start).
Answer the following briefly. a) Why is a doubly linked list more useful than a singly linked list? b) Explain the steps involved in inserting a new value in a binary heap with the help of a suitable example.
4. Someone gives you an array with n numbers and claims that it is not a max- heap. Design an algorithm to prove or disprove the claim. Also, analyze the runtime and space complexity of your algorithm.
4. Assume X = {3,4,6,9,8,7,16,15,20,19} is an array representation of a binary heap, such that each element in X represents a node on the heap. Delete one node from the heap. After the deletion, the root node of the tree representing the heap is node The left child of the root node is node and the right child of the root node is node . The right child of node 8 is node A Que
Please don't copy the solution. Assignment: For this week’s assignment, you’re going to be creating a Heap Sorter. It should be able to take input (using CIN), place it into proper Max Heap form in an array, and once it’s done accepting input, put the array in order using a Heap Sort. For the sake of simplicity, our heap trees will be made of an array that’s only seven elements long. Make sure to define your arrays ahead of time with garbage filler data before you start putting in your CIN data. Remember to use the binary heap traversal trick when dealing with your array-based tree. Please sort the following lists of inputs: 1.) 12, 40, 2, 6, 88, 90, 5 2.) 1, 2, 3, 4, 5, 6, 7 3.) 7, 6, 5, 4, 3, 2, 1 4.) 42, 64, 355, 113, 101, 13, 35 5.) 12, -5, 24, -4, 48, -3, 96
b) Given the following arrays, which ones could represent a max-heap? Choose all that apply. Assume the indices start from 1. {23, 17, 14, 6, 13, 10, 1, 12, 7, 5} {23, 17, 14, 6, 13, 10, 1, 5, 7, 12} . {23, 17, 14, 7, 13, 10, 1, 5, 6, 12} {23, 17, 14, 7, 13, 10, 1, 12, 5, 7}
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
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.)
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-
Computer Science Java Programming ******* Write a Java application that will, given an appropriate data structure, will be able to track the following module and its dependencies as well as implement an appropriate search algorithm to create the correct graph for any given module. The graph will show all the corresponding dependent modules in their correct order of dependency. Must use Stack, either Double ArrayList or Linked List, and simple search to implement this. Module A: Dependencies: B D E K L Module B: Dependencies: F G M Module C: Dependencies: F Module D: Dependencies: G Module E: Dependencies: B A Module F: Dependencies: B Module G: Dependencies: NONE Module K: Dependencies: M Module L: Dependencies: Q Module M: Dependencies: A Module Q: Dependencies: NONE Ensure that dependencies are only visited only once. To test: Input A Your Output: Module A. Dependencies: B F G M D E K M L Q