Discrete Mathematics |Gate-2012| previous year questions| Set-8

Set-8 Gate-2012 Discrete Mathematics

Discrete Mathematics |Gate-2012|

  1. The recurrence relation capturing the optional execution time of the Towers of Hanoi problem with nn discs is  [GATE – 2012]

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

Answer : d)


Back to GATE-HOME


Spread the love

Leave a Comment

Your email address will not be published. Required fields are marked *