made easy test series

Question

Comments

Please before asking the question, search for it. You will definitely find this question. You are just creating duplicate questions.

---

It is option a)

As g(n) is always $g(n)>=c.h(n)$ it can take value $n, n^{2}, n^{3}.....$ and $f(n)$ is $f(n)<=c.g(n)$ it can take values smaller than or equal to n and $h(n)= ⊖(n)$,

$f(n).h(n)$ is always lesser than or equal to n and when we add it with $g(n)$, it depends on what value $g(n)$ takes(it is always greater than n) as overall function will be that of higher order, hence overall function is $Ώ(n)$

Answer 1

https://gateoverflow.in/172551/time-complexity