Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Asymptotic Worst Case Time and Time Complexity
Given below are two statements:
Statement I: If f and g are two functions and f = O(g) but g ≠ o(f), we say that the growth rate of g is smaller than that of f
Statement II: The class of all decision problems decided by a TM in exponential time, that is O(2k), k being a constant.
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