For each pair of functions f(n) and g(n), indicate whether f(n) = O(g(n)), f(n) = Ω(g(n)), and/or f(n) = Θ(g(n)), and provide a brief explanation of your reasoning. (Your explanation can be the same for all three; for example, “the two functions differ by only a multiplicative constant” could justify why f(n) = n, g(n) = 2n are related by big-O, big-Omega, and big-Theta.)
i. f(n) = n^2 log n, g(n) = 100n^2
ii. f(n) = 100, g(n) = log(log(log n))
For each pair of functions f(n) and g(n), indicate whether f(n) = O(g(n)), f(n) = Ω(g(n)), and/or...
Compare the following pairs of functions f, g. In each case, say whether f- o(g) f-w(g), or f = Θ(g), and prove your claim. 157. f(n) -100n+logn, gn) (logn)2. 158,介f(n) = logn, g(n) = log log(n2). 159. . f(n)-n2/log n, g(n) = n(log n)2. 160·介介f(n)-(log n)106.9(n)-n10-6 . 161. (n)logn, g(n) (log nlog n 162. f(n) n2, gn) 3. Compare the following pairs of functions f, g. In each case, say whether f- o(g) f-w(g), or f = Θ(g), and prove...
Need help with 1,2,3 thank you. 1. Order of growth (20 points) Order the following functions according to their order of growth from the lowest to the highest. If you think that two functions are of the same order (Le f(n) E Θ(g(n))), put then in the same group. log(n!), n., log log n, logn, n log(n), n2 V, (1)!, 2", n!, 3", 21 2. Asymptotic Notation (20 points) For each pair of functions in the table below, deternme whether...
1. (10 pts) For each of the following pairs of functions, indicate whether f = 0(g), f = Ω(g), or both (in which case f-6(1). You do not need to explain your answer. f(n) (n) a) n (b) n-1n+1 (c) 1000n 0.01n2 (d) 10n2 n (lg n)2 21 е) n (f) 3" (g) 4" rl. 72 i-0 2. (12 pts) Sort the following functions by increasing order of growth. For every pair of consecutive functions f(n) and g(n) in the...
For each pair of functions determine if f(n) ? ?(g(n)) or f(n) ? ?(g(n)) or f(n) ? O(g(n)) and provide a proof as specified. For each of the following, give a proof using the definitions. 1. f(n) = log(n), g(n) = log(n + 1) 2. f(n) = n3 + nlog(n) ? n, g(n) = n4 + n 3. f(n) = log(n!), g(n) = nlog(n) 4. f(n) = log3(n), g(n) = log2(n) 5. f(n) = log(n), g(n) = log(log(n))
1. a) Let f(n) = 6n2 - 100n + 44 and g(n) = 0.5n3 . Prove that f(n) = O(g(n)) using the definition of Big-O notation. (You need to find constants c and n0). b) Let f(n) = 3n2 + n and g(n) = 2n2 . Use the definition of big-O notation to prove that f(n) = O(g(n)) (you need to find constants c and n0) and g(n) = O(f(n)) (you need to find constants c and n0). Conclude that...
Prove that if f (n) = O (g (n)) and g (n) = Ohm (h (n)), it is not necessarily true that f(n) = O (h (n)). You may assume that low degree (i.e., low-exponent) polynomials do not dominate higher degree polynomials, while higher degree polynomials dominate lower ones. For example, n^3 notequalto O (n^2), but n^2 = O (n^3). Prove that if f (n) = O (g (n)) and g (n) = Ohm (h (n)), it is not necessarily...
6. (15) Determine whether each statement is true or false. Justify your answers. (a) if f(n) = O(g(n)), then g(n) = O(f(n)). (b) if f(n) = O(g(n)), then g(n) = Ω(f(n)). (c) if f(n) = Θ(g(n)), then g(n) = Θ(f(n)).
1. For each of the following pairs of functions, prove that f(n)-O(g(n)), and / or that g(n) O(f(n)), or explain why one or the other is not true. (a) 2"+1 vs 2 (b) 22n vs 2" VS (c) 4" vs 22n (d) 2" vs 4" (e) loga n vs log, n - where a and b are constants greater than 1. Show that you understand why this restriction on a and b was given. f) log(0(1) n) vs log n....
Consider the following nine functions for the questions that follow: 1. (n^2)/2 + 3 2. 3n^3 3. 2^n 4. 5n 5. 12n 6. 4^n 7. log_2(n) 8. log_3(n) 9. log_2(2n) (a) Make a table in which each function is in a column dictated by its big-Θ growth rate. Functions with the same asymptotic growth rate should be in the same column. If functions in one column are little-o (o(n) = O(n) - Θ(n)) of another column, put the slower growing...
For each of the following functions, indicate the class Θ(g(n)) the function belongs to. ( Use the simplest g(n) possible in your answers). Prove your assertions. a. ( n2 + 1)10 b. 2n+1 + 3n-1 c. [ log2 n ] d. 2n lg(n+2)2 + ( n+2)2 lg n/2 e. ( 10n2 + 7n + 3)1/2