retagged by
3,162 views

2 Answers

Best answer
1 votes
1 votes
(x+1)log(x 2+1) can be reduced to x log x 2 as addition of a constant term can be truncated.

Therefore, x log x 2 =2x log x = O(x log x)

f(x) = max ( complexity of (x+1)log(x 2+1) , complexity of  x 2) = max ( O(x log x) , O( x 2) = O(x 2)

Answer : B

$O(x^2)$ is also $O(x^3)$ as per the definition of big-O. But such strict correctness is used for exams like GATE, not ISRO test.
edited by
Answer:

Related questions

4 votes
4 votes
2 answers
1
go_editor asked Jul 25, 2016
8,246 views
Given two sorted list of size 'm' and 'n' respectively. The number of comparisons needed in the worst case by the merge sort algorithm will bem $\times$ nmax(m, n)min(m, ...
1 votes
1 votes
1 answer
2
go_editor asked Jul 25, 2016
3,685 views
For any B-tree of minimum degree t $\geq$ 2, every node other than the root must have at least ____ keys and every node can have at most ____ keys.t-1, 2t+1t+1, 2t+1t-1, ...
2 votes
2 votes
1 answer
3
go_editor asked Jul 28, 2016
2,425 views
Let $A$ and $B$ be two $n$ $\times$$n$ matrices. The efficient algorithm to multiply the two matrices has the time complexity$O(n^3)$$O(n^{2.81})$$O(n^{2.67})$$O(n^2)$
1 votes
1 votes
1 answer
4
go_editor asked Jul 26, 2016
2,871 views
Linux operating system usesAffinity schedulingFair Preemptive SchedulingHand ShakingHighest Penalty Ratio Next