Consider implementing heaps by using arrays, whichone of the following array represents a heap?O a. [30,26,12,23,10,8]O b. [8,12,13,14,11,16]O. [30,26,12,13,10,18]O d. [18,12,13,10,11,16]Which of the following is wrong, after each iteration ofquick sorting?a. None of the other answersO b. Elements in one specific (e.g. left) portion aresmaller than the selected pivot.C. Elements in one specific (e.g. right) portion arelarger than the selected pivot.O d. The selected pivot is already in the rightposition in the final sorting order.

Answered: Image /qna-images/answer/f2287c2e-e515-4d2f-aa21-538a8308c355.jpg

Consider implementing heaps by using arrays, which one of the following array represents a heap? O a [30,26,12,23,10,8] O b. [8,12,13,14,11,16] O. [30,26,12,13,10,18] O d. [18,12,13,10,11,16] Which of the following is wrong, after each iteration of quick sorting? O a. None of the other answers Ob. Elements in one specific (e.g. left) portion are smaller than the selected pivot. O. Elements in one specific (e.g. right) portion are larger than the selected pivot. O d. The selected pivot is already in the right position in the final sorting order.

Consider implementing heaps by using arrays, which one of the following array represents a heap? O a [30,26,12,23,10,8] O b. [8,12,13,14,11,16] O. [30,26,12,13,10,18] O d. [18,12,13,10,11,16] Which of the following is wrong, after each iteration of quick sorting? O a. None of the other answers Ob. Elements in one specific (e.g. left) portion are smaller than the selected pivot. O. Elements in one specific (e.g. right) portion are larger than the selected pivot. O d. The selected pivot is already in the right position in the final sorting order.

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

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
Suppose you want to use Heapsort to sort the contents of the following array in alphabetical order: [C; A; G; B; D; F; E]. Answer the two questions that follow. What follows is a fill in the blank question with 7 blanks. Show the array's contents after the first deletion operation has been performed on the heap resulting from the previous question. Fill in only one letter in each open space.[ Blank 1.______. ; Blank 2. ______. ; Blank 3. ________. ; Blank 4. ______. ; Blank 5. __________ ; Blank 6. ________-. ; Blank 7. _____-. ]
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*-
What additional requirement is placed on an array, so that binary search may be used to locate an entry? Select one: O a. The array elements must form a heap. O b. The array's size must be a power of two. O c. The array must have at least 2 entries. O d. The array must be sorted.
Given the following maxheap, assuming heap entries start at index 1, show the heap after adding the entry 87 using the array representation. index 0 1 2 3 456 value 45 12 40 87 24 a. index 01 23 456 7 value 45 12 40 8 7 24 87 O b. index 0 1 2 3 4 5 6 7 value 45 1287872440 C. index 0 1 2 3 4 5 67 value 87 45 12 24 40 87 d. index 01 2 3 4 5 67 value 87 45 12 40 24 87 e. index 0 1 2 3 456 7 value 87 12458724 40
Suppose you want to use Heapsort to sort the contents of the following array in alphabetical order: [C; A; G; B; D; F; E]. Show the array's contents after the heapBuild method has been performed, i.e. when the array represents a heap
Suppose you want to use Heapsort to sort the contents of the following array in alphabetical order: [C; A; G; B; D; F; E]. Answer the two questions that follow. Show the array's contents after the first deletion operation has been performed on the heap resulting from the previous question (question 14). Fill in only one letter in each open space. [
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.
1. In a linked stack the bottom of the stack is in the beginning of the list and the top of the stack is at the end of the list. 2. In the worst case a sequential search of an array with N elements is O(N). 3. In the best case, a sequential search of an array with 1,000 elements requires this many comparisons: ________________. 4. Java programmers can define their own exception classes. A. True B. False 5. If a recursive method does not have a base case: A. a syntax error is identified.B. an exception will be thrown. C. it will operate more efficiently.D. it will run forever.
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 3 4 5 6 1 30 20 15 | 16 | 13 10| 12 2 What will the contents of this array look like after one element has been sorted, and the remaining heap has been rebuilt.
: Let S1 and S2 be two stacks. 1. It is possible to keep two stacks in a singlearray, if one grows from position 1 of the array, and the other grows from the last position? 2.Write a procedure Push(x, S) that pushes element x onto stack S, where S is one or the other ofthese two stacks. Include all necessary error checks in your procedure.