Data Structures and Algorithms in Java
6th Edition
ISBN: 9781118771334
Author: Michael T. Goodrich
Publisher: WILEY
expand_more
expand_more
format_list_bulleted
Question
Chapter 4, Problem 28R
Program Plan Intro
Largest size of n of a problem P:
The following table is need to fill the time taken for each function “f(n)” that the
Before filling the table, let us discuss about the calculation of following time for second, hour, month and century.
- It is known that 1 microsecond is
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Problem FIG can be solved in O(RK + R log log n) time usingθ(R) space.Write Algorithm for it
Given an n-element array X of integers, Algorithm A executes an O(n) time computation for each even number in X and an O(log-n) time computation for each odd number in X. What are the best case and worst case for running time of algorithm C?
Consider the following algorithm:
function MYSTERY(A, n)
/Input: Array A and integer n. A has size of least n
if n <1 then
return 0
else
temp + 3 x A[n – 1]+ MYSTERY(A,n – 2)
return temp
(a) Write down recurrence equations that describe the running time of
the algorithm. Assume the base operation has a cost k.
(b) Solve these recurrence equations and give the asymptotic time
complexity of the algorithm. Use Big-O notation for your answer.
Chapter 4 Solutions
Data Structures and Algorithms in Java
Ch. 4 - Prob. 1RCh. 4 - The number of operations executed by algorithms A...Ch. 4 - The number of operations executed by algorithms A...Ch. 4 - Prob. 4RCh. 4 - Prob. 5RCh. 4 - Prob. 6RCh. 4 - Prob. 7RCh. 4 - Prob. 8RCh. 4 - Prob. 9RCh. 4 - Prob. 10R
Ch. 4 - Prob. 11RCh. 4 - Prob. 12RCh. 4 - Prob. 13RCh. 4 - Prob. 14RCh. 4 - Prob. 15RCh. 4 - Prob. 16RCh. 4 - Prob. 17RCh. 4 - Prob. 18RCh. 4 - Prob. 19RCh. 4 - Prob. 20RCh. 4 - Prob. 21RCh. 4 - Prob. 22RCh. 4 - Show that 2n+1 is O(2n).Ch. 4 - Prob. 24RCh. 4 - Prob. 25RCh. 4 - Prob. 26RCh. 4 - Prob. 27RCh. 4 - Prob. 28RCh. 4 - Prob. 29RCh. 4 - Prob. 30RCh. 4 - Prob. 31RCh. 4 - Prob. 32RCh. 4 - Prob. 33RCh. 4 - Prob. 34RCh. 4 - Prob. 35CCh. 4 - Prob. 36CCh. 4 - Prob. 37CCh. 4 - Prob. 38CCh. 4 - Prob. 39CCh. 4 - Prob. 40CCh. 4 - Prob. 41CCh. 4 - Prob. 42CCh. 4 - Prob. 43CCh. 4 - Draw a visual justification of Proposition 4.3...Ch. 4 - Prob. 45CCh. 4 - Prob. 46CCh. 4 - Communication security is extremely important in...Ch. 4 - Al says he can prove that all sheep in a flock are...Ch. 4 - Consider the following justification that the...Ch. 4 - Consider the Fibonacci function, F(n) (see...Ch. 4 - Prob. 51CCh. 4 - Prob. 52CCh. 4 - Prob. 53CCh. 4 - Prob. 54CCh. 4 - An evil king has n bottles of wine, and a spy has...Ch. 4 - Prob. 56CCh. 4 - Prob. 57CCh. 4 - Prob. 58CCh. 4 - Prob. 59CCh. 4 - Prob. 60PCh. 4 - Prob. 61PCh. 4 - Perform an experimental analysis to test the...Ch. 4 - Prob. 63P
Knowledge Booster
Similar questions
- The search algorithm developed will be used for users to search the catalog for all items matching the search keyword(s), and there are a total of 15000 items in the catalog. During development, three different algorithms were created. • Algorithm A runs in constant time, with a maximum runtime of 1.10 seconds and returns all matching results. ● Algorithm B runs in logarithmic time, with a maximum runtime of 0.3 seconds, and returns only the first result. ● Algorithm C runs in linear time, with a maximum runtime of 1.50 seconds and returns all matching results. Which algorithm would be the least suitable for the requirements stated? In your answer, justify your choice by explaining why you picked that algorithm, and why you did not pick the other two algorithms.OND OND OND DADarrow_forwardPlease written by computer sourcearrow_forwardAnother recursive algorithm is applied to some data A = (a₁, ..., am) where m = 2* (i.e. 2, 4, 8,16 ...) where x is an integer ≥ 1. The running time T is characterised using the following recurrence equations: T(1) = c when the size of A is 1 T(m) = 2T (2) + c otherwise Determine the running time complexity of this algorithm.arrow_forward
- Design a dynamic programming algorithm for solving the problem of finding if there are exactly K entries in array 'A' whose sum is equal to a given integer 'T'arrow_forwardConsider array A of n numbers. We want to design a dynamic programming algorithm to find the maximum sum of consecutive numbers with at least one number. Clearly, if all numbers are positive, the maximum will be the sum of all the numbers. On the other hand, if all of them are negative, the maximum will be the largest negative number. The complexity of your dynamic programming algorithm must be O(n2). However, the running time of the most efficient algorithm is O(n). Design the most efficient algorithm you can and answer the following questions based on it. To get the full points you should design the O(n) algorithm. However, if you cannot do that, still answer the following questions based on your algorithm and you will get partial credit. Write the recursion that computes the optimal solution recursively based on the solu- (a) tion(s) to subproblem(s). Briefly explain how it computes the solution. Do not forget the base case(s) of your recursion.arrow_forwardI have two functions in a function, one has a time complexity of O(n) and the other one has a time complexity of O(n^2). what is the overall time complexity of the function? def function(): def function1(): def function2():arrow_forward
- A computer science student designed two candidate algorithms for a problem while working on his part-time job The time complexity of these two algorithms are T,(n) = 3 n logn and T2(n) = n6/5 a) Which algorithm is better? Why? b) If we run both algorithms at the same time with an input size of 105, which algorithm produces results faster than the other one? Why?arrow_forwardA problem is NP-Complete. Any algorithm to solve this problem is likely to run in time. O (n) O (n lg n) ㅇ(2") o (n3 O (lg n)arrow_forwardSecond order Spada numbers are well established in the insurance industry. Formally they are defined by the recurrence: Si={Si−1 %( Si−2+1) :i≥ 2 , 1:i=0 ,7 :i=1} Give an O(n) time algorithm to compute the n-th Second order Spada numberarrow_forward
- Overview One of the oldest methods for computing the square root e of a number is the Babylonian Method e. The Babylonian Method uses an iterative algorithm to make successively more accurate estimates of a number's square root. The algorithm stops iterating when the estimate shows no further sign of improvement, or when the estimate is within some acceptable margin of error. The acceptable margin of error is often called an epsilon. Assuming that you need to solve for the square root of x, the algorithm works as follows. 1. Choose an epsilon value that determines how close your solution should be to the actual square root value before you decide it is "good enough." Because this assignment asks you to solve for the square root to three decimal places, we can safely set the epsilon value to 0.0001 (four decimal places). This guarantees that our solution will be accurate to the precision we need to display to the screen. 2. Choose an initial estimate e for the square root of x. An easy…arrow_forwardSuppose that you have five different algorithms (A. B. C. Dand E) for solving a problem. To solve a problem of size n, the number of operations used by each algorithm is as follows. As n grows, which algorithm uses the most operations? Algorithm number of operations n2+n3 B 2n+1 log n100 26 + log n6 nlogn)2 +1 Ainorithmarrow_forwardSuppose a recursive algorithm performs 2 recursive calls. Assume the first recursive call isof size at most 70% the original input size, and the second call is of size at most 25% of theoriginal input size. In addition, the algorithm performs O(n) additional work after makingthese recursive calls. What is the big-Oh run time of this algorithm?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning