retagged by
431 views

2 Answers

1 votes
1 votes

See here

A) is wrong. n2 + n can not have lower bound n.

B) well this very much wrong. For being Theta(n) , we need n to be lower bound. That is not possile

C) This is correct. n2 + n has lower bound n2 .
 D) This is wrong.n2 + n has upper bound n2

Upshot, Dont believe answers in Test series ! .

0 votes
0 votes

f(n) is greater than n. 

g(n) is grater than n2 

f(n) +g(n)= max (f(n),g(n)) = lower bound n2

Related questions

0 votes
0 votes
2 answers
1
radha gogia asked Jul 7, 2018
1,595 views
foo(int n) { for(int i=0 ; i<n ;i++) for(int j=i ; j<=i*i ;j++) if(j%i==0) { for(int k=0;k<j;k++) printf("hii"); } } How to proceed here for analyzing the time complexity...
3 votes
3 votes
1 answer
3
Sanjay Sharma asked Feb 20, 2018
1,149 views
An array A is of length n has log( n) distinct numbers.What is the time complexity of sorting A by best comparison based algorithm ?