The GATE Grind

GATE 2008 CS – Question 39

Algorithms · Asymptotic Analysis and Time/Space Complexity · 2 marks · Multiple choice

Let $f(n)=2^n$, $g(n)=n!$, $h(n)=n^{\log n}$. Which asymptotic statement is true?

  1. $f=O(g);\ g=O(h)$
  2. $f=\Omega(g);\ g=O(h)$
  3. $g=O(f);\ h=O(f)$
  4. $h=O(f);\ g=\Omega(f)$

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (D) $h=O(f);\ g=\Omega(f)$

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Asymptotic Analysis and Time/Space Complexity questions

All Asymptotic Analysis and Time/Space Complexity questions →