The recurrence relation of Tower of Hanoi is given below T(n)={1 if n=1 and 2T(n-1) if n >1 In order to move a tower of 5 rings from one peg to another, how many ring moves are required?

(A) 10
(B) 16
(C) 31
(D) 32

»Important Links:

Latest Jobs in Pakistan Govt Jobs in Pakistan Private Jobs
NTS Jobs Bank Jobs Teaching Jobs
Police Jobs Wapda Jobs Army Jobs
PPSC Jobs Nadra Jobs CTSP Jobs

Leave a Reply

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

error: Content is protected !!