UGC NET CS 2013 Sep-paper-2
November 26, 2023
UGC NET CS 2008 Dec-Paper-2
November 26, 2023
UGC NET CS 2013 Sep-paper-2
November 26, 2023
UGC NET CS 2008 Dec-Paper-2
November 26, 2023

Question 5351 – Algorithms

Big – O estimate for
f(x) = (x+1) log(x2+1)+3x2 is given as

Correct Answer: B

Question 298 Explanation: 
f(x) = (x+1) log(x2+1)+3x2 in this function, 3x2 is leading term. So, we can call asymptotically O(n2).
A
O(x log x)
B
O(x2)
C
O(x3)
D
O(x2 log x)
SONAL Nagariya
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!