retagged by
638 views
1 votes
1 votes

2n  is the order of 3n  . 

Is it True or False ? State with reason.

retagged by

1 Answer

3 votes
3 votes

Say f(n)=2n and g(n)=3n

 f(n)=o(g(n))(small-oh) //////not tightest upperbound

so answer is false

edited by

Related questions

0 votes
0 votes
1 answer
1
gshivam63 asked May 31, 2016
480 views
It is true or false..(log n)! and (log log n)! are polynomially bounded?What does polynomially bounded means?
0 votes
0 votes
1 answer
2
A_i_$_h asked Oct 17, 2017
323 views
1.(n + a)b = $\Omega$(nb) for all real numbers a , b >02.na+1=theta(nb) iff a=b for all real numbers a , b>0which is true?Acyclic graph directory structure is more flexib...
0 votes
0 votes
0 answers
3
mb14 asked Jul 6, 2022
300 views
Iterative functions:f(n)= n/lognc=2What is f*(n) ?How to solve this question?
0 votes
0 votes
1 answer
4
akash.dinkar12 asked Jun 28, 2019
469 views
Obtain asymptotically tight bounds on $lg\ (n!)$ without using Stirling’s approximation. Instead, evaluate the summation $\sum_{k=1}^{n} lg\ k$.