How much time does an algorithm take to solve a problem of size n if this...

How much time does an algorithm take to solve a problem of size n if this algorithm uses 2n2 + 2n operations, each requiring 10-8 seconds, with these values of n?

a) 10:

b) 20:

c) 50:

d) 100

Solutions

Expert Solution

milcah answered 8 months ago

Next > < Previous

Related Solutions

QUESTION 1 How long? How much time in seconds does it take for the sled to...

QUESTION 1 How long? How much time in seconds does it take for the sled to go down part of a hill? A sled with a total mass of 671 kilograms is going down a straight part of a hill where the angle of incline is 10.6 degrees. The length of the straight part of the hill is 76.4 metres. The speed of the sled at the top of the hill is 4 meters per second. The combined forces of...

What is the largest size n of a problem that can solve in 1 second, assuming...

What is the largest size n of a problem that can solve in 1 second, assuming that the algorithm to solve the problem takes sqrt(n) microseconds? (sqrt stands for square root) 1 10^(6) 10^(12) 10^(3) How does the array arr = [8, 5, 3, 6, 10] look like after the second iteration (when j = 3) of the j loop on line 1 of the give pseudocode below? insertion_sort.PNG 1 for j 2 do 3 // Insert A[j] into the...

How much time would it take for the stock portfolio to double in value if the...

How much time would it take for the stock portfolio to double in value if the rate of return is 9.0%? Use the rule of 70 to find the answer [just google it]. State the answer as a number with 2 decimals (for example, 13.02).

Please explain how to do this problem and solve. Bid Ask Price Size Price Size $...

Please explain how to do this problem and solve. Bid Ask Price Size Price Size $ 94 150 $ 94.5 300 $ 93.5 300 $ 94.8 300 $ 92 600 $ 95 500 $ 90.8 450 $ 95.5 550 b. Norman Pilbarra submits a market order to buy 600 shares. What is the maximum price that he will pay? (Round your answer to 2 decimal places.)

Using Java implement a searching algorithm to solve the following problem (please specify the searching algorithm...

Using Java implement a searching algorithm to solve the following problem (please specify the searching algorithm being used) Requirements Choose one problem with an algorithm and implement it. You should show and explain the result whatever you got. I recommend using N-Queen problem (at least N=8 or more) or any simple perfect games. For example, - N-Queen problem with hill climbing - N-Queen problem with simulated annealing - N-Queen problem with genetic algorithm - Tic-Tac-Toe with Minimax

How many character comparisons will the BMH algorithm perform to solve the pattern search problem shown...

How many character comparisons will the BMH algorithm perform to solve the pattern search problem shown below? text: my next door neighbor is a witch pattern: is explain c language

Here is my algorithm: Ask how much time they need to do the assignment(Total hours) Ask...

Here is my algorithm: Ask how much time they need to do the assignment(Total hours) Ask how many days are available Calculate hour per day needed Store time needed per day in a variable 2. How many hours per day are available Store hours available per day in a variable Ask user how much time is spent doing other things Calculate how much time is available per day 24- (# of hours not available) Display how much time is available...

Knapsack algorithm problem: Consider the following variation of the Knapsack problem. There are n types of...

Knapsack algorithm problem: Consider the following variation of the Knapsack problem. There are n types of items, let call them 1,2,3,4,...,n. There are exactly c_i copies of item i, and each such copy has value v_i and weight w_i. As before, the knapsack capacity is W, and the other constraint is that you can only take at most c_i copies of item i ( since no more are available). Show how to compute the optimal value that can be achieved...

Solve as much as you can Using the Lehmer algorithm (Zi = (a Zi-1 + c)...

Solve as much as you can Using the Lehmer algorithm (Zi = (a Zi-1 + c) (mod m) 0 < Zi < m-1 Ui = Zi / m, with m = 16, a = 5, c = 3, and Z0 = 7, generate three random numbers (U1,U2,U3 ) ………….(SO (a)) subject is Modeling and Simulations

Objectives: Learn to analyze a computational problem and construct an algorithm to solve it Learn to...

Objectives: Learn to analyze a computational problem and construct an algorithm to solve it Learn to use sequential statements to build a basic program to implement the algorithm, using correct programming format Learn to use the scanf function to read and store values entered on the keyboard by the user, and the printf function used to display output results on the computer monitor Learn to convert math formulas into correct arithmetic expressions using variables, constants, and library math functions Learn...

Subjects