Semester -3    Subject -Data Structures and Algorithms

Define Tower of Hanoi . Explain algorithm 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 briefly Infix expression, Polish Notation and Reverse Polish Notation ?


View

Explain about Implementation of Queue ? 


View

Explain Dequeues- Double Ended Queues ? 


View

Define Circular Queue. Describe implementation of Circular Queue ? 


View

Define Tower of Hanoi . Explain algorithm for Tower of Hanoi ? 


View

Explain simple queue ? Brief disadvantages of simple queue.


View

Define Recursion. Explain types and requirement of recursion ?


View