Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Asymptotic Worst Case Time and Time Complexity Asymptotic Notations
Assume that f(n) and g(n) are asymptotically positive. Which of the following is correct?
1
f(n) = O(g(n)) and g(n) = O(h(n)) ⇒ f(n) = ω(h(n))
2
f(n) = Ω(g(n)) and g(n) = Ω(h(n)) ⇒ f(n) = O(h(n))
3
f(n) = o(g(n)) and g(n) = o(h(n)) ⇒ f(n) = o(h(n))
4
f(n) = ω(g(n)) and g(n) = ω(h(n)) ⇒ f(n) = Ω(h(n))