Saved Bookmarks
| 1. |
(a) Define Tower of Hanoi problem as a recurrence relation problem(6 marks)and solve it through a recurrence tree. |
|
Answer» The tower of hanoi is a mathematical puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top. We have to obtain the same stack on the third rod. |
|