An algorithm with running time E(/n(log n)²) spends exactly 1 millisecond to process an input of 1.024 data items. Assuming that the time T(n) of processing n items is directly proportional to n(lg n), that is T(n) = c/n(lg n)² ("lg" denotes "base-2 log"), derive a formula for T(n), and estimate how long this algorithm will process 216 items.

An algorithm with running time E(/n(log n)²) spends exactly 1 millisecond to process an input of 1.024 data items. Assuming that the time T(n) of processing n items is directly proportional to n(lg n), that is T(n) = c/n(lg n)² ("lg" denotes "base-2 log"), derive a formula for T(n), and estimate how long this algorithm will process 216 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

Similar questions

Code req positive integer decompose, find an algorithm to find the number ofnon-negative number division, or decomposition. The complexity is O(n^2). Example 1:Input: 4Output: 5Explaination:4=44=3+14=2+24=2+1+14=1+1+1+1 Example :Input: 7Output: 15Explaination:7=77=6+17=5+27=5+1+17=4+37=4+2+17=4+1+1+17=3+3+17=3+2+27=3+2+1+17=3+1+1+1+17=2+2+2+17=2+2+1+1+17=2+1+1+1+1+17=1+1+1+1+1+1+1.
USING PYTHON NOT MATLAB We can use the sum of the first n terms of the Taylor series of e x with a = 0 to estimate the value of the exponential function. Using a logarithmic y axis, plot the fractional error in the estimated e x (compared to numpy.exp(x)) as a function of n (n ranging between 1 and 80) for (a) x = 15 and (b) x = −15. [You can plot the two cases either as different curves on the same plot or in different plots, whichever is clearer.] Discuss the contributions of truncation and roundoff to the fractional error for the different values of x and n. Also discuss how you could reduce truncation and roundoff errors in order to estimate e x more accurately using the Taylor series.
Find the running time for each of the following algorithms. Show work by finding a table of values for each while loop, writing the summations, then solving. Be sure to show work on both the upper bound and lower bound, justify the split, and check that the bounds differ by only a constant factor. Use asymptotic notation to write the answer. c) Func4(n) 1 2 3 4 567∞∞ s = 0; for i 1 to 5n do 8 j← 3i; while (j < i³) do s+ s + i - j; j+5 x j; end end 8 return (s);
Consider the following algorithm: GeoSum(r, n) Input: Positive real number r and natural number n pn+1 Output: 1. r-1 If (n = 0), Return( 1 ) sum= GeoSum(r, n – 1)+r" Return sum Prove that this algorithm computes the function f(r,n) = " . (HINT: Prove by induc- pn+1 r- tion on n.)
Solve the following recurrences assuming that T(n) = Θ(1) for n ≤ 1. a) T (n) = 3T (n/π) + n/π b) T(n) = T(log n) + log n
Sort the following functions in terms of asymptotic growth from smallest to largest. In particular, the resulting order should be such that f₁ =0(f₂), f₂=0 (f 3), and so on. 1 2 I I I - ✓ 3" ✓ log (23) 14 1 1010 n 11/10 ✓ nln(12n) ✓ 52! ✓ log_²(n) ✓20200.1
Present an O(n) time algorithm to compute the coefficients of the polynomial (1 + x)^n. How much time is needed if you use the FFT algorithm to solve this problem?
Let f (f(n) and g(n)) be asymptotically nonnegative functions. Using the basic definition of Θ notation, prove that max(f(n), g(n)) = Θ(f(n) + g(n)),
Given a matrix of size N x M where N is the number of rows and M is the number of columns, write an algorithm to find the shortest path from the top-left cell to the bottom-right cell that passes through all the cells with a prime value and avoids cells with composite values. The algorithm should have a time complexity of O(NM log(max(N,M))).
Given the problem of basic multiplication: Input: Two n-digit nonnegative integers, x and y. Output: The product x - y e.g. 5 9 7 4 1 2 6 3 1 7 9 2 3 8 4 4 0 1 1 9 4 + 9. 7 4 7 5 4 5 1 6 2 What is the time complexity considering the number of primitive operations, i.e. additions and multiplications, performed? O(n*) O O(n) O None of the choices O(n) O(n")
Consider the following recursive algorithm, where // denotes integer division: 3//2 = 1, 5//2 = 2, etc. F(n):if n <= 1: returnF(n//2)for i from 0 to n for j from 0 to n//2 print(i+j) Let function T(n) denote the running time of this algorithm. Derive T(n) and prove its worst case timecomplexity