Define Tower of Hanoi. Explain Problem statement for Tower of Hanoi ? 


==> Tower of Hanoi---

  • Tower of Hanoi, is a mathematical puzzle which consists of three tower (pegs) and more than one rings;
  • These rings are of different sizes and stacked upon in ascending order i.e. the smaller one sits over the larger one. There are other variations of puzzle where the number of disks increase, but the tower count remains the same.


Share to whatsapp

More Questions from Data Structures and Algorithms Module 2

Explain Algorithm for Enqueue operation  and Algorithm for Dequeue operation using array ? 


View

Explain Multiple stacks ?


View

Define Recursion. Explain types and requirement of recursion ?


View

Explain Factorial of a number ? 


View

Define Circular Queue. Describe implementation of Circular Queue ? 


View

 Explain Applications of Stack ? 


View

Define Evaluation of Postfix expression. Explain algorithm and example for it ? 


View