in Algorithms retagged by
277 views
3 votes
3 votes

Given that $f(n)=O(g(n))$ (where $\mathrm{O}$ is Big-O) and $f(n)=\Omega(g(n))$, which of the following statement is always true?

  1. $f(n)=o(g(n))$ (here $o$ is small-$o).$
  2. $f(n)=\theta(g(n))$.
  3. $f(n)=\omega(g(n))$.
  4. Both A and B are always true.
in Algorithms retagged by
277 views

1 comment

$ \large{\colorbox{yellow}{Detailed video solution of this question with direct time stamp}}$

All India Mock Test 4 - Solutions Part 1

0
0

1 Answer

1 vote
1 vote

given $f(n)=O(g(n))$ and $f(n)=\Omega(g(n))$ $\rightarrow$ $f(n)=\theta(g(n))$

consider $f(n)=n$ and $g(n)=2n$

$f(n)=O(g(n))$ and $f(n)=\Omega(g(n))$

$f(n)=\theta(g(n))$

$f(n)\not=\omega(g(n))$

$f(n)\not=o(g(n))$

$f(n)\not=o(g(n))$, by definition for this to be true $f(n)$ should be less for all values of c in $cg(n)$ which is not the case in the above example

$f(n)\not=\omega(g(n))$, by definition for this to be true $f(n)$ should be greater for all of c in $cg(n)$ values which is not the case in the above example

Answer:

Related questions