808 views
0 votes
0 votes
Let $f(x),g(x)$ and $h(x)$ be functions which of the following statement is false?

a).   if $f(x)$ is $O(g(x))$ and $g(x)$ is $O(h(x))$ then $f(x)$ is $O(h(x))$.

b).  if $f(x)$ is $\Omega(g(x))$ and $f(x)$ is $\Omega(h(x))$ then $g(x)$ is $\Omega(h(x))$

c). Both $(a)$ and $(b)$

d). Neither $(a)$ nor $(b)$

I mean according to me , option (a) is correct , right ? by the rule of transitivity .

Please correct me , if I am wrong.

3 Answers

1 votes
1 votes

A.
f(x) = O(g(x)) i.e. f(x) <= g(x)  ...........(1)
g(x) = O(h(x)) i.e. g(x) <= h(x) ...........(2)

from (1) and (2),
f(x) <= g(x) <= h(x)
f(x) = O(h(x)) 


B.
f(x) = Ω(g(x)) i.e. f(x) >= g(x)  ...........(1)
g(x) = Ω(h(x)) i.e. g(x) >= h(x) ...........(2)

from (1) and (2),
f(x) >= g(x) >= h(x)
f(x) = Ω(h(x)) 

both are true..

TRANSITIVITY holds for O, Ω as well..
PS : in case of small O & Ω only reflexivity & Symmetricity faiils.

0 votes
0 votes
There is no transitive rule here..

Let f(n) = n^4

       G(n) = n^2

and h(n) = n^3

So here both first conditions given in problem satisfy but the condition g(n) € omega o (h(n) ) fails
Answer:

Related questions

1 votes
1 votes
3 answers
1
0 votes
0 votes
1 answer
2
21 votes
21 votes
7 answers
3
Pranay Datta 1 asked Jun 10, 2015
18,658 views
Let $f(n)= &Omega;(n), g(n)= O(n)$ and $h(n)= &#1138;(n)$. Then $[f(n). g(n)] + h(n)$ is:&Omega; (n)O (n)&#1138; (n)None of these
0 votes
0 votes
2 answers
4
neha singh asked Mar 18, 2017
725 views
a) lossy and dependency preservingb)lossless and dependency preservingc)losslsess and no dependency preservingd)lossy and not dependency preserving