Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Asymptotic Worst Case Time and Time Complexity
Given below are two statements:
Let f(n) and g(n) be asymptotically positive functions. The following conjectures are given
Statement I: f(n) ≥ 1 and f(n) = O(g(n)) ⇒ g(n) = Ω(f(n))
Statement II: f(n) = O(g(n)) ⇒ Ig(f(n)) = O(1g(g(n))) where Ig(g(n)) ≥1 for all sufficient large n.
In the light of the above statements, choose the most appropriate answer from the options given below.
1
Both Statement I and Statement II are correct
2
Both Statement I and Statement II are incorrect
3
Statement I is correct but Statement II is incorrect
4
Statement I is incorrect but Statement II is correct