• edited by
627 views
0 0 votes
closed as a duplicate of: Asymptotics

I got that Statement 3 can be false in case we have function 1/n, then its square become 1/n^2. But I don't think statement 2 is true either. Please prove whether I'm correct or wrong.

Question No. 20
Marks :
0.33

Find the False Statement
\[
O\left(2^{a}\right)=O\left(3^{n}\right)
\]
$O\left(\log n^{2}\right)=O(\log n)$
\[
f(n)=0\left(f(n)^{2}\right)
\]
\[
\left(2^{2 \operatorname{cog}}(\log n)\right)=O\left(n^{2} \log n\right)
\]

Solution:
consider a case when
\[
f(n)=c-\frac{1}{n}
\]

Position:
Show:

Related questions

1 1 vote
1 answers 1 answer
1.9k
1.9k views
Anjana Babu asked Dec 20, 2016
1,914 views
On which of the following recurrence relation Master Theorem cannot be applied?$\checkmark \mathrm{T}(\mathrm{n})=2 \mathrm{~T}(\mathrm{n} / 2)+\mathrm{n} \log \mathrm{n}...
1 1 vote
0 0 answers
370
370 views
Hradesh patel asked Jan 28, 2017
370 views
#plz explain??Onlive Tell|Terbootgote 2117 - Yohoe Senn!SCIENTFKC CALOLATOR -ति GutEOrerlonFrev?https//testbookcom/gate-cs/tests/5733450e995a2d6576t9a007\#/5olunionsMy Te...
3 3 votes
2 answers 2 answers
1.5k
1.5k views
Akash Kanase asked Jan 6, 2016
1,510 views
Q). What is the complexity of finding the $50^{th}$ smallest elements in an already constructed binary min-heap?$\theta(1)$$\theta(logn)$$\theta(n)$$\theta(nlogn)$solutio...
2 2 votes
4 4 answers
5.8k
5.8k views
Pankaj Joshi asked Jan 22, 2017
5,763 views
The optimal time required in merging the list of size 11, 21, 33, 34,45,54,60 ismy answer (11+21)*4+ 33*3 +(34+45)*3 + (54+60)*2but the provided answer is 269 to 282I don...