1. For each of the following pairs of functions, prove that f(n)-O(g(n)), and / or that...
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...
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...
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...
(g(n)), g(n) is (f(n)), or both. 1. For each of the following pairs of functions determine if f(n) is f(n) = (na – n)/2, g(n) = 3n · f(n) = n log n, g(n) = n/n/2
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...
3. (10 pts) For each of the following functions f(n), prove the stated claim by providing constants no C1, and c2 such that for all n2 no, cig(n) S f(n) or f(n) c2g(n), and provide a calculation that shows that this inequality does indeed hold (a) f(n) 2n2 3n3-50nlgn10 0(n3) O(g(n)) (b) f(n)-2n log n + 3n2-10n-10-Ω ( 2)-0(g(n))
Let f(n) and g(n) be asymptotically positive functions. Prove or disprove each of the following conjectures. f(n) = O(g(n)) implies g(n) = Ω(f(n)) . f(n) = O(g(n)) implies g(n) = O(f(n)). f(n) + g(n) = Θ(min(f(n),g(n))).
Prove or find a counterexample for the following. Assume that f (n) and g (n) are monotonically increasing functions that are always larger than 1. f (n) = o (g (n)) rightarrow log (f (n)) = o (log (g (n))) f (n) = O (g (n)) rightarrow log (f (n)) = O (log (g (n))) f (n) = o (g (n)) rightarrow 2^f (n) = o (2^g (n)) f (n) = O (g (n)) rightarrow 2^f (n) = O (2^g...
Let f(n) = 5n^2. Prove that f(n) = O(n^3). Let f(n) = 7n^2. Prove that f(n) = Ω(n). Let f(n) = 3n. Prove that f(n) =ꙍ (√n). Let f(n) = 3n+2. Prove that f(n) = Θ (n). Let k > 0 and c > 0 be any positive constants. Prove that (n + k)c = O(nc). Prove that lg(n!) = O(n lg n). Let g(n) = log10(n). Prove that g(n) = Θ(lg n). (hint: ???? ? = ???? ?)???? ?...
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))