1. Heap and Heapsort. (a) Run Build-Heap on the array [10,9,4,7,6, 2, 3, 1, 8, 5] to construct a min heap. Write down the resulting array. Then, run the loop in Heapsort for three iterations. For each iteration write down the array after Heapify-Down is finished. You do not need to show intermediate steps. (b) Show that the leaves of a heap occupy the positions [],...,n- 1 of the array. (c) In the procedure Build-Heap, why do we decrease i from [2]-1 to 0 instead of increasing from 0 to []-1? Give an example array where increasing i fails to create a valid min heap.

1. Heap and Heapsort. (a) Run Build-Heap on the array [10,9,4,7,6, 2, 3, 1, 8, 5] to construct a min heap. Write down the resulting array. Then, run the loop in Heapsort for three iterations. For each iteration write down the array after Heapify-Down is finished. You do not need to show intermediate steps. (b) Show that the leaves of a heap occupy the positions [],...,n- 1 of the array. (c) In the procedure Build-Heap, why do we decrease i from [2]-1 to 0 instead of increasing from 0 to []-1? Give an example array where increasing i fails to create a valid min 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
18. Use heapsort to sort the array [13, 80, 37, 63, 36, 25, 97, 32, 15, 17, 43]. Show the initial heap and the array after each max deletion is performed. Each max deletion should place the deleted element at the end of the array
1. Given the unsorted array write the pseudo code so sort it and find a specific element x a. Find (array, x) //first sort the array //search for element x using binary search 2. Given the following stack A = { 29,18,10,15,20,9,5,13,2,4,15} Create a queue by taking the elements from the top of the stack and adding them to a queue 3. what are the worst-case, average-case, and best-case complexities of insertion-sort, merge-sort, and quiksort 4. Given the following array A = {3,13,89,34,21,44,99,56,9} Illustrate the execution of the sorting algorithms on the given array: * Merge-sort algorithm * Quicksort (using the median-of-three pivot) algorithms * Selection Sort algorithm For each fundamental iteration or recursion of the algorithm, write the content of the array. 5. Evaluate the following postfix expression made using a stack: 234*5*-
Problem: B Implement a doubly circular SORTED linked list (using dummy node) that consists of following operations: Insert (into the sorted position) b. Show all c. Search(search for a specific integer data) d. Delete (find it and delete) e. Length (current length of the list) а.
Stack: push(x) adds x to top of stack pop() removes top element of stack and returns it size() returns number of elements in stack Select all options that allow for an efficient implementation based on the discussions from class. For any array implementation, you can assume the array is large enough so that making a larger one is not needed when pushing an item to the stack. Using an array with the top at the front of the array. Using an array with the top at the back of the array. Using a singly linked list with the top at the head of the list. Using a singly linked list with the top at the tail of the list. None of these choices allows for an efficient implementation of all methods.
Stack stores elements in an ordered list and allows insertions and deletions at one end. The elements in this stack are stored in an array. If the array is full, the bottom item is dropped from the stack. In practice, this would be equivalent to overwriting that entry in the array. And if top method is called then it should return the element that was entered recently.
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).
Consider the Stack ADT: Stack: push(x) adds x to top of stack pop() removes top element of stack and returns it size() returns number of elements in stack Select all options that allow for an efficient implementation based on the discussions from class. For any array implementation, you can assume the array is large enough so that making a larger one is not needed when pushing an item to the stack. Using an array with the top at the front of the array. Using an array with the top at the back of the array. Using a singly linked list with the top at the head of the list. Using a singly linked list with the top at the tail of the list. ENG
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
Towers of Hanoi. There is a story about Buddhist monks who are playing this puzzle with 64 stone disks. The story claims that when the monks finish moving the disks from one post to a second via the third post, time will end. Eschatology (concerns about the end of time) and theology will be left to those better qualified; our interest is limited to the recur- sive solution to the problem. A stack of n disks of decreasing size is placed on one of three posts. The task is to move the disks one at a time from the first post to the second. To do this, any disk can be moved from any post to any other post, subject to the rule that you can never place a larger disk over a smaller disk. The (spare) third post is provided to make the solution possible. Your task is using c++ write a recursive function that describes instructions for a solution to this problem. We don’t have graphics available, so you should output a sequence of instructions that will solve the problem. Hint: If you could…
Please don't copy the solution from other websites. 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
Objectives: The code for the different stack and queue operations in both implementations (array and linked list) are discussed in the lectures: and are written in the lectures power point. So the main object of this assignment is to give the student more practice to increase their understanding of the different implementation of these operations. - The students also are asked to write by themselves the main methods in the different exercises below; The Lab procedures: The following files must be distributed to the students in the Lab - arrayImpOfStack.java // it represents an array implementation of the stack. - pointerImOfStack.java // it represents a Linked List implementation of the stack. - pointerImOfQueue.java // it represents a pointer implementation of the queue. Then the students by themselves are required to write the code for the following questions Ex1) Given the file arrayImpOfStack.java then write a main method to read a sequence of numbers and using the stack…