MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 2 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structure knowledge and support exam preparation. Choose a topic below to get started.
| 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. | |
| 2. |
The optimal data structure used to solve Tower of Hanoi is _________ |
| A. | Tree |
| B. | Heap |
| C. | Priority queue |
| D. | Stack |
| Answer» E. | |