MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
What is the number of moves required to solve Tower of Hanoi problem for k disks? |
| A. | 2k - 1 |
| B. | 2k + 1 |
| C. | 2<sup>k</sup> + 1 |
| D. | 2<sup>k</sup> - 1 |
| Answer» E. | |