(Solved) : 4 True False 1 Correct Answer 1 Incorrect Answer 0 Omitted Answer F N N T N Entails T N 0 Q44082288 . . .
4. True or false? (+1 for each correct answer, -1 for each incorrect answer, 0 for each omitted answer) (a) f(N) = N(t(N)) entails t(N) = 0(f(n)) (b) t(N) = 2(f(n)) entails t(N) = 0 (f(n)) (c) t(N) = o(f(n)) entails t(N) = 0(f(n)) (d) f(N) = o(t(N)) entails t(N) = 0 (f(n)) (2) f(N) = O(t(N)) entails t(N) = 0(f(n)) (f) t(N) = O(f(n)) entails t(N) = 0(f(n)) 5. Consider the following function, which given an integer n computes the sum of the first na elements of the arithmetic progression: int sum ThroughSquare(int n){ int sum = 0; for (int i = 1; i <= n*n; i++) sum += i; return(i); What is the tightest bound you can provide for the asymptotic growth rate of the running time, if we use n as he measure of the problem size? (3 pts: 2 for correctness of the bound + 1 for tightness of the bound). f(n)). Hint: review how I 6. Prove that if T(N) = f(N) + g(N)) and g(N) = off(N)) then T(N) = proved another algebraic big-O property in class (4 points) Show transcribed image text 4. True or false? (+1 for each correct answer, -1 for each incorrect answer, 0 for each omitted answer) (a) f(N) = N(t(N)) entails t(N) = 0(f(n)) (b) t(N) = 2(f(n)) entails t(N) = 0 (f(n)) (c) t(N) = o(f(n)) entails t(N) = 0(f(n)) (d) f(N) = o(t(N)) entails t(N) = 0 (f(n))
(2) f(N) = O(t(N)) entails t(N) = 0(f(n)) (f) t(N) = O(f(n)) entails t(N) = 0(f(n)) 5. Consider the following function, which given an integer n computes the sum of the first na elements of the arithmetic progression: int sum ThroughSquare(int n){ int sum = 0; for (int i = 1; i
Expert Answer
Answer to 4. True or false? (+1 for each correct answer, -1 for each incorrect answer, 0 for each omitted answer) (a) f(N) = N(t(N…
OR