Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Asymptotic Worst Case Time and Time Complexity Asymptotic Notations
A least integer n such that f(x) is O(xn) for each of the following functions. Arrange follow according to the value of n in increasing order :
A. f(x) = 3x3 + (log x)4
B. f(x) = (x5 + x2 + 1)/(x3 + 1)
C. f(x) = (x3 + x2 + 1)/(x2 + 1)
D. f(x) = (x2 + 5 log x)/(x2 + 1)
Choose the correct answer from the options given below :
1
D, C, A, B
2
D, C, B, A
3
B, C, A, D
4
B, A, C, D