GATE CSE
First time here? Checkout the FAQ!
x
+3 votes
62 views

asked in Algorithms by Loyal (3.7k points)   | 62 views
Answer should be D.

2 Answers

+3 votes
Best answer

mit quiz pdf link. here is the required part:

answered by Veteran (50.9k points)  
selected by
+3 votes
$f(n) = \Theta(g(n))$ and $g(n) = \Theta(h(n))$ implies $f(n) = \Theta(h(n))$ (by transitivity).

Now $f(n) = \Theta(h(n))$ implies $h(n) = \Theta(f(n))$ (symmetry property). So statement I is true.

Similarly in statement II, by transitivity, we get $f(n) = O(h(n))$ this implies $h(n) = \Omega(f(n))$, by transpose symmetry.

Statement III is false.  consider  $f(n) = n^2$ and $g(n)=4n^2$

Statement III would be true, if the conclusion was $f(n) = \Theta(g(n))$ or $g(n) = \Theta(f(n))$.

You can refer to these properties in CLRS.
answered by Loyal (3.4k points)  

Related questions

+3 votes
1 answer
1
asked ago in Algorithms by Pranjali1894 (51 points)   | 36 views
+1 vote
0 answers
2
asked ago in Algorithms by manu00x Boss (7.8k points)   | 53 views


Top Users Aug 2017
  1. ABKUNDAN

    4660 Points

  2. Bikram

    4366 Points

  3. akash.dinkar12

    3258 Points

  4. rahul sharma 5

    3042 Points

  5. manu00x

    2682 Points

  6. makhdoom ghaya

    2410 Points

  7. just_bhavana

    2100 Points

  8. Tesla!

    1918 Points

  9. stblue

    1682 Points

  10. joshi_nitish

    1608 Points


24,928 questions
32,024 answers
74,385 comments
30,113 users