cksort is asymptotically faster than insertion sort)a. In the worst caseb. On average(2) Quicksort is asymptotically slower than mergesort(17)YesNo Don't knowNo Don't knowDon uonYesa. In the worst caseb. On averageYesNo Don't knowNo Don't know(3) To sort 8 numbers it is necessary to make at leastYesa. 17 comparisonsb. 18 comparisons toYesNo Don't knowNo Don't know(4) To find 2 heavier coins among 14 same coins using lever scales it is necessary to make at leastCOLCL Dops (220Yesa. 6 comparisonsb. 5 comparisonsYesNo Don't knowYesNo Don't know(5) Given set S of points in the Euclidean plane, Voronoi graph of S alwaysa. contains MST of SYesNo Don't knowb.has at most 3.1*|S| edgesYesNo Don't know2tabozon boppcu YesYesNo Don't knowс.has at most 2.75*|S| edgesNo Don't knowd. has at least |S| edgesNo Don't knowYes(6) Given set S of points in the Euclidean plane, convex hull of S alwaysYesYese. contains edge connecting closest pair of pointsa. contains MST of Sb. has at most 2.5*|S| edgesNo Don't knowNo Don't knowNo Don't knowNo Don't knowYesYesd. contains edge connecting closest pair of pointsFinal CSC 4520c. has at least 1.05*|S| edgesNAME(21) amdtiouIAoit

As i have read guidelines i can provide answer of only 3 sub parts of questions in case of multiple…

ksort is asymptotically faster than insertion sort - )a. In the worst case No Don't know No Don't know b. On average Yes Yes 2) Quicksort is asymptotically slower than mergesort a. In the worst case Yes No Don't know b. On average No Don't know Yes 3) To sort 8 numbers it is necessary to make at least Yes No Don't know a. 17 comparisons b. 18 comparisons No Don't know COLCL Dops (2 es To find 2 heavier coins among 14 same coins using lever scales it is no a. 6 comparisons b. 5 comparisqns

ksort is asymptotically faster than insertion sort - )a. In the worst case No Don't know No Don't know b. On average Yes Yes 2) Quicksort is asymptotically slower than mergesort a. In the worst case Yes No Don't know b. On average No Don't know Yes 3) To sort 8 numbers it is necessary to make at least Yes No Don't know a. 17 comparisons b. 18 comparisons No Don't know COLCL Dops (2 es To find 2 heavier coins among 14 same coins using lever scales it is no a. 6 comparisons b. 5 comparisqns

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

Select all the statements that are false, bubble sort is defined below:* Quicksort is the fastest sorting algorithm If you are lucky, you can get O(n) time complexity in Mergesort On the worst case, Bubble sort will give you O(n logn) time complexity Average time complexity of insertion sort is much better than bubble sort Selection sort has the worst space complexity among all the sorting algorithm
Given Array: [17 25 2 3 5 7 9 10 11 12] In the first pass, a greater element will be placed in the last of the array. Pass 1: [17 2 3 5 7 9 10 11 12 25] Pass 2: [ 2 3 5 7 9 10 11 12 17 25] this array will be sorted in 2 passes in bubble sort. Question: How can you optimize the bubble sort algorithm to stop unnecessary iteration after the array is sorted.
Pls. answer the 2 questions. write a short explanation each.
Dry run below algorithm and find the item (55) in the following array (C). Also write the name of the given algorithm. 0 1 89 15 3 4 5 6 7 C=| 10 26 55 44 43 34 Igorithm -) Search (C, item) -) low =0 =) high=n-1 E) while (low s high) low + high mid = 2 if (item = C[mid]) then print ('Search is Successful') else if (item < C[mid]) then high = mid -1 else low = mid +1 =) print ("Search is unsuccessful")
Every time it has to find two arrays to join, do the following to generate a bottom-up mergesort that takes use of array order: Find the first item in a sorted subarray, then the second, and eventually merge them (by raising a pointer until it finds a smaller element in the array than its predecessor). When estimating the algorithm's execution time, take into account the array size and the number of maximal ascending sequences in the array.
suppose an even parity code is used to send a message across a noisy channel. which of the ff received word is sure to contain at least one error? a. 10101011 b. 111111 c. 000000 d. 001111
Write an array that when sorting using Selection Sort, requires O(n^2) time complexity and only O(n) using Insertion Sort. Provide explanations for how you got your answer.
Given an array of 5-DWORD elements with values: 10,3,9,8,2 copy the values from last to first to a second 5-DWORD-element array Note 1: Use the loop as well as push and pop instructions Note 2: Use the LENGTHOF operator to get the number of elements of the array Note 3: Your algorithm should work for any array irrespective of its size with minimal mod- ifications
Implement external sort: for sort phase use normal sort, for merge phase use two way merge to merge n sorted files (merge2way(n)), for array sort use heapsort. Also write merge(f1, f2, f3) to merge two sorted files f1 and f2 into f3.. Write mergenway(n) method and print execution time of both merges for initial input file over 10MB data. A sample input is as follow:Note:First input is max array size for sort 10 84 82 52 80 96 85 75 75 82 87 92 89 57 94 93 92 63 99 87 72 73 56 74 50 84 62 72 55 86 75 74 100 83 60 53 68 89 67 66 65 72 94 73 54 98 96 85 75 75 82 87 92 89
using Insertion sort algorithm, the intermediate sorting results of sorting the array (1,3,24,19,5,2} in ascending order are: starting: {11 || 3,24,19,5,2,99} Result of the first iteration: { Result of the second iteration: Result of the third iteration: Result of the fourth iteration: { Result of the fifth iteration: {
Using the method that decreases k by 1 after each pass, sort the following list of numbers using the shell sort ( k=3 ):13 9 5 7 12 2 3 14 6 1
c++