Answered: e) If an Insertion Sort of 10 items…

e) If an Insertion Sort of 10 items took 70 seconds, how long would you expect it. to take for an insertion sort of 1. 10 Items? 2. 1, 000 items?

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

Related questions

Q: If there is no % specified, how can we calculate EF?

A: Introduction: Calculation of the Exposure Factor (EF) The Exposure Factor indicates a percentage…

Q: A machine needs a minimum of 100 sec to sort 1000 names by quick sort. The minimum time needed to…

A: Best case time complexity of quick sort to take the minimum time to sort is O(n log n), i.e.…

Q: 7. The combination of three estimates as a weighted average is used to estimate the duration. This…

A: Explanation: PERT is primarily used to organize, schedule, and integrate various activities inside…

Q: You are to create a program that enables you to measure the execution times of various sorting…

A: Algorithm: Start the program. Generate a random number of array of size 10000 Perform the bubble…

Q: Using Big-O notation, list in a table the best, average and the worst case performance for each of…

A: Actually, array is a collection of elements.

Q: Please make the choice that I have to choose clear thanks so much

A: Solution: Given,

Q: Given the following BST Show the steps for performing the followings: Search 75 Insert 100 min and…

A: First lets understand the procedure to Search, Insert, Min and Max, Dele Search k: step1) compare k…

Q: Q2/ Without using the min command and using the while loop, find the minimum value of matrix (x)…

A: Here I have named the variable as min and not used the command min. Algorithm : Step 1 : create the…

Q: c. What is the time complexity of Linear search and Binary search average case. d. Paste the output…

A: The question is to find the average time complexity of Linear Search, Binary Search and also find…

Q: Q3. The given coordinates are (0,0), (0,2),(2,0),(2,2) for representing a rectangle/square ,you are…

A: To execute x- and y-shearing on the provided object is the query. old square/rectangle corner…

Q: If we have a matrix Y you can delete the third row using the following :command Y= 7 6. 8. 10 20 30…

A: y=[2 3 5 7 ;3 4 6 8 ;3 10 20 30; 12 14 16 18]y(3,:)=[0]

Q: Use ones /zeros functions, create a 4 x 5 matrix in which the first two rows are Os and the next two…

A: Since no programming language is mentioned, I am using Matlab. 1. Code: A=zeros(4,5);…

Q: False True ceil(x) Round to smallest intergerned less than x floor(x) Round to largest integer not…

A: 1. Ceil(x) function is used to return the smallest integer that is greater than or equal to X. That…

Q: The product of two matrices is a calculation between two matrices. When the inner dimensions are the…

A: Program plan: Define two matrices. Multiply two matrix elements with each other. C[i][j] =…

Q: 5. Minimize the following DFA: qo

A: For minimization of DFA we find the equivalence of dfa In zero equivalence we make two set First…

Q: Reference the Insertion Sort flowchart. what symbol(s) would need to change to get the algorithm to…

A: The code is given in the below step by step

Q: B The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is

A: Steps to find min and max. Select two elements Upadate min and max on comparison. So total number…

Q: The sequential and binary search algorithms each have their own set of advantages, but what are the…

A: Introduction : Algorithm is, in fact, a step-by-step procedure. Without jumping, a sequential search…

Q: Create a plot of so that a Graham Scan algorithm runs in the following sequence: push push push push…

A: Graham Scan Algorithm: Let points[0..N-1] be the input array. Find the lowest-maximum factor by…

Q: Q2: Using DDA line algorithm to draw the line from the equation + = 1, where X=0, 2 10 Y=0.

A: Solution: Given the equation : x/2 + y/10 = 1 and x=0,y=0 Since x = 0 put x=0 in the given…

Q: What is the complexity of the sequential search algorithm(also known as Linear Search algorithm)?…

A: Sequential search is the simplest type of search it is used when a list of integers is not in any…

Q: The given coordinates are (0,0), (0,2),(2,0),(2,2) for representing a rectangle/square ,you are…

A: Q3. Given the following coordinates of a square/rectangle: A (0,0), B (0,2), C (2,0), D (2,2)…

Q: NUMERICAL ANALYSIS :::::::::: Please can you write it in clear line (font).. Use Jacobi method to…

A: Answer: 4x + 3y +2z = 8 -x + 3y - z = 1 2x + 3y -6z = -1 x = 1/4(8 - 3y - 2z) y = 1/3(1 + 2 + x) z…

Q: Recall the insertion sort algorithm . Assume the following list of keys:45, 50, 18, 60, 30, 29, 89,…

A: The given list of keys is: 45, 50, 18, 60, 30, 29, 89, 10, 90, 2, 25, 70 There are the total number…

Q: The worst-case for the sequential search algorithm is when the item is:

A: In computer science, a linear search or sequential search is a method for finding an element within…

Q: Diagonal matrix is a square Matrix is where all elements are zero's except those on the first raw…

A: Answer to the above question with definition of diagonal matrix is stated in step2.

Q: Sequential Money Problem (Coin Row) • Suppose there are n coins lined up side by side on a table;…

A: a) coins should not be picked from the adjacent sides. b) The picked up coins must be maximum…

Q: (c) Who is the most popular? (d) If we're having a party and want to distribute the message the most…

A: c) Meghan is most popular. Reason :- because he is connected with 4 other buddy which is maximum,…

Q: Imagine that you work in a courier company and you have six packages you need to deliver. You don't…

A: class Parcel{ //Linear Search algorithm //The function will return minimum weight parcel.…

Q: For the table shown below Job No. Arrival Time Run time 1 11 2 5 28 3 12 2 4 2 10 5 16 What is…

A: Given : Jobs with : arrival time run time

Q: How do you use Minimax algorithm?

A: Mini-max algorithm. is a kind of backtracking algorithm or recursive algorithm which is basically…

Q: Using matlab do this. Create a row vector of 1’s that has 4 rows. Now create a column vector of 1's…

A: The MATLAB code for the following problem is given as below:

Q: How many comparisons will Shell sort use to sort the following list if gaps of 3 then 1 are used?…

Q: The moment (torque) of a force is given by M =F-d-sin(0), where M is the moment, F is the force, and…

A: Given : Theta value = 45 Force vector d vector Output : Values for moments

Q: Q5: Write the number of the sentence and (T) for true and (F) for false sentences. 1. Mean command…

A: The answers for all 5 whether they are true or false given below.

Q: Homework İTÜ A laboratory test was performed to obtain the change of concentration with time. Test…

A: I have implemented the code find the value at t=20 display the result as per the given description.…

Q: How many comparisons will insertion sort use to sort the following list into ascending order? [14,…

A: We need to perform insertion sort for the given list in ascending order. Here is the list [14, 13,…

Q: Given M be the number of boosting rounds, N be the number of training examples,

A: The correct option is B which is O(MN2K) Explanation…

Q: 7) Using Depth First Search, find a path from q to y. w y

A: Depth First Search (DFS) algorithm starts at the root node and explores as far as possible untill…

Q: Using R solve this question. One of the functions we will be using often is sample(). Read the help…

A: Given: Using R solve this question. One of the functions we will be using often is sample(). Read…

Q: Data: 45,30,50,25,60,55,75,70 From the data, do the sorting using 1. Selection sort method 2.…

A: Selection sort The selection sort algorithm sorts an array by repeatedly finding the minimum element…

Q: PLEASE TYPE ONLY**** 25 horses - we need to find the fastest 3 in correct order 1st,2nd and 3d each…

A: The answer is 7 races.

Q: Question 4) Sort the following list in alphabetical order using bubble sort algorithm? Show all the…

A: PROGRAM CODE: a = ['XH', 'WS', 'OA', 'UT', 'SK', 'UY', 'IT'] // declare and initialize the…

Q: The running time of locating the ith item in an array is ____.

A: The running time of a program is calculated based on the number of steps executed or number of…

Q: find this conduct of arranging by segment in numerous office programming for overseeing bookkeeping…

A: Here have to determine about conduct of arranging problem statement.

Q: Make sure to find the following: Total (actual) time: Time wasted: % Wasted:

Q: sort COMPUTER word, using bubble sort and insertion sort, calculate how many swaps and how many…

Question

e) If an Insertion Sort of 104 items took 70 seconds, how long would you expect it. to take
for an insertion sort of
1. 10 Items?
2. 1, 000 items?

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Choose quickly..
Recall the insertion sort algorithm . Assume the following list of keys:45, 50, 18, 60, 30, 29, 89, 10, 90, 2, 25, 70a. Exactly how many key comparisons are executed during the third iteration of the for loop? b. Exactly how many key comparisons are executed during the tenth iteration of the for loop? c. Exactly how many key comparisons are executed to sort this list using insertion sort algorithm?
(a) In the binary search algorithm, what are the four cases you have to consider at each iteration and what do you have to do in each case?
Which algorithm requires time directly proportional to the size of the input?a) linear search b) binary searchc) merge sort d) selection sort
Please written by computer source Use the Quick sort to sort the following list in ascending order. Show your work stepby step.5, 7, 12, 23, 8, 1, 2, 4.
A Discipline Concerning Computers Is there a way to find out when quick sort changes to insertion sort? Additionally: several online resources assert that the number is 10, but why?
Computer Science How to find the threshold between insertion sort and quick sort? -ps: some websites says it’s 10 but why?
PYTHON Using binary search, how many checks would it take to determine if the number 400 is or is not contained in the list shown below? Make sure provide an explanation of your answer. [100, 150, 175, 225, 235, 245, 300, 400, 1000, 1300]
You are to create a program that enables you to measure the execution times of various sorting algorithms to better understand their efficiency characteristics. For each sorting algorithm, you are to measure and record the execution times for various lists of randomly generated integers. The list sizes used for the test cases should start at 10,000, and go up by 10,000 for each test until the execution time for the test exceeds 60 seconds. The algorithms for which you are to run the tests are: • Selection sort • Bubble sort • Merge sort
Create and test predictions regarding the insertion sort and selection sort running times for arrays with just two key values, assuming that the values are equally likely to occur.
Just how long it takes to complete an insertion sort depends on a variety of factors, including the number of comparisons and the number of movements.
q8) Which of the following searching algorithm, search for the data by the "Sequential" method? a. Linear Search Algorithm b. Bubble Sort Algorithm c. Binary Search Algorithm d. Non-Linear Search Algorithm