Stacks on Data Structure and Algorithms related Questions and Answers


Question :   What is the number of moves required in the Tower of Hanoi problem for k disks?
1. 2k – 1
2. 2k + 1
3. 2k + 1
4. 2k – 1
Answer :   4 - 2k – 1  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter