Which one of the following statements is TRUE for all positive functions f(n) ?
Which one of the following statements is TRUE for all positive functions f(n) ? Correct Answer f(n<sup>2</sup>) = θ(f(n)<sup>2</sup>), when f(n) is a polynomial
The correct answer is option 1.
Concept:
Option 1: f(n2) = θ(f(n)2), when f(n) is a polynomial.
True, Theta is an Asymptotic Notation used to represent the asymptotically tight bound on the growth rate of an algorithm's runtime.
If f(n) = Θ(g(n)), then there exists positive constants c1, c2 such that 0 ≤ c1.g(n) ≤ f(n) ≤ c2.g(n)
Explanation:
f(n2) = θ(f(n2)) here f(n) is polynomial
f(n) = n3
f(n2) = (n2)3 = n6
f(n2) = (n3)2 = n6all are equal.
Option 2: f(n2) = o(f(n)2)
False, The little o notation is one of them. Little o notation is used to describe an upper bound that cannot be tight.
If f(n) = o(g(n)), then there exists positive constants c such that 0 ≤ f(n) < c.g(n)
Explanation:
Option 3: f(n2) = O(f(n)2) when f(n) is an exponential function.
Hence the correct answer is f(n2) = θ(f(n)2), when f(n) is a polynomial.