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

asked in Algorithms by Active (2.4k points)   | 60 views
Answer should be D.

2 Answers

+3 votes
Best answer

mit quiz pdf link. here is the required part:

answered by Veteran (46.8k 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.3k points)  

Related questions

0 votes
4 answers
1
asked in Algorithms by Nitesh Choudhary Junior (623 points)   | 68 views
0 votes
2 answers
2
asked in Algorithms by student2018 Junior (569 points)   | 63 views


Top Users May 2017
  1. akash.dinkar12

    3146 Points

  2. pawan kumarln

    1608 Points

  3. sh!va

    1580 Points

  4. Arjun

    1326 Points

  5. Devshree Dubey

    1230 Points

  6. Angkit

    1028 Points

  7. Debashish Deka

    1012 Points

  8. Bikram

    970 Points

  9. LeenSharma

    810 Points

  10. srestha

    662 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 May 22 - 28
  1. pawan kumarln

    234 Points

  2. Ahwan

    118 Points

  3. jjayantamahata

    106 Points

  4. joshi_nitish

    106 Points

  5. Aditya GN

    63 Points


22,722 questions
29,048 answers
65,039 comments
27,510 users