The recurrence relation capturing the optimal execution time of the Towers of…

GATE · 2012 · CS · Computer Science & IT

1. A.

   $T(n) = 2T(n − 2) + 2$

2. B.

   $T(n) = 2T(n − 1) + n$

3. C.

   $T(n) = 2T(n/2) + 1$

4. D.

   $T(n) = 2T(n − 1) + 1$

Attempted by 269 students.