Menu
Home / GATE 2017-2018 / GATE CSE :: Discussion

Discussion :: GATE CSE

  1. The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is
    2. A.
    T(n) = 2T(n − 2) + 2
    B.
    T(n) = 2T(n − 1) + n
    C.
    T(n) = 2T(n/2) + 1
    D.
    T(n) = 2T(n − 1) + 1

    View Answer

    Workspace

    View Answer

    Answer : Option D

    Explanation :

    -NA-

Write your comments here:

Be The First To Comment