To complete the table for given function
Explanation of Solution
Given Information:The time taken by
Explanation:
Since 1 microsecond is equal to
Consider the function
as follows:
Therefore, the value of
Since 1 hour is equal to 3600 seconds. Therefore, 1 hour is equal to
Again, consider the function
as follows:
Therefore, the value of
Consider a month is equal to 30 days and a year is equal to 365 days.
Similarly, calculate the other values of
Complete the table for different values of
as follows:
1 second | 1 minute | 1 hour | 1 day | 1 month | 1 year | 1 century | |
62746 | 2801417 | 133378058 | 2755147513 | 71870856404 | 797633893349 | ||
1000 | 7745 | 60000 | 293938 | 1609968 | 5615692 | 56176151 | |
100 | 391 | 1532 | 4420 | 13736 | 31593 | 146679 | |
19 | 25 | 31 | 36 | 41 | 44 | 51 | |
9 | 11 | 12 | 13 | 15 | 16 | 17 |
Table 1
Want to see more full solutions like this?
Chapter 1 Solutions
Introduction to Algorithms
- Problem 1. (a) Describe an algorithm that computes the product of n given integers. (b) Find the running time function T(n) of this algorithm.arrow_forwardConsidering the function f(x) = x – cos(x), what is the value of x7 after performing fixed point iteration. Assume an initial guess of 1. Use the equation form that will seem fit according to the choices provided.Group of answer choices 0.72210 0.71537 0.76396 0.72236arrow_forwardConsider a function f: N → N that represents the amount of work done by some algorithm as follow: f(n) = {(1 if n is oddn if n is even)┤ Prove or disprove. f(n) is O(n). Please show proof or disproofarrow_forward
- I need the answer in a specific format like this: Algorithm Proof of Correctness Runtime Analysis As stated in the question the algorithm should have a runtime of O(n log n)arrow_forwardDetermine the big Θ for each and put the functions in their order from fastest time complexity to slowest: a. n log n + narrow_forwardFor a given problem with inputs of size n, algorithms running time,one of the algorithm is o(n), one o(nlogn) and one o(n2). Some measured running times of these algorithm are given below: Identify which algorithm is which and explain the observed running Times which algorithm would you select for different value of n?arrow_forward
- Order the following from lowest to highest big O complexity. In other words, the slowest growing functions should be placed first and the fastest growing last. 2N-1 5 N5 9999 600 * N * log(N) N2arrow_forwardFor each problem below, find the time complexity/running time in terms of N:arrow_forwardArrange this functions in increasing order of asymptotic complexity Select one: a. f1, f2, f3 b. f2, f1, f3 c. f2, f3, f1arrow_forward
- For each of the following two code fragments, give its asymptotic running time in the form T(n) = (f(n)) for an appropriate function f(n), and justify your answers. s = 0; for i=1 to n for j= i to n for k= i to j if (A[k] > A[i]+ A[j]) then s = s+1 return sarrow_forwardThe function below has the recursive relation T(x,y) = 2T(y/2)+O(1) when x,y>0Knowing these information, find the following: 1) The worst-case time complexity of the function2) The worst-case auxiliary space complexity of the function3) Explanation as to how the time complexity of the function can be improved without using multiplication operations.arrow_forwardConsider the following function, such that it is represent an algorithm’stime for execution:f (n) = n^3 + 1Explain why the following sentence provides no meaningful information about the execution time for the algorithm:“The execution time for the algorithm is at most Ω(n^3).arrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education