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

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

2 Answers

+3 votes
Best answer

mit quiz pdf link. here is the required part:

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

Related questions

+1 vote
0 answers
1
asked ago in Algorithms by Akriti sood Veteran (10.7k points)   | 18 views
+1 vote
0 answers
3
asked ago in Algorithms by pC Veteran (19.5k points)   | 85 views
Top Users Jan 2017
  1. Debashish Deka

    9716 Points

  2. sudsho

    5560 Points

  3. Bikram

    5290 Points

  4. Habibkhan

    4990 Points

  5. Vijay Thakur

    4498 Points

  6. Arjun

    4418 Points

  7. saurabh rai

    4236 Points

  8. Sushant Gokhale

    4226 Points

  9. Kapil

    3848 Points

  10. santhoshdevulapally

    3808 Points

Monthly Topper: Rs. 500 gift card

19,449 questions
24,228 answers
53,954 comments
20,373 users