Practice Towers Of Hanoi (8.6) - Design and Analysis of Algorithms - Design & Analysis of Algorithms

Practise this section

10 questions

Flashcard drill
3 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
4 questions · about 3 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What are the three pegs called in the Towers of Hanoi?
Show hintHide hint
Think about their naming convention.
Question 2.
What does moving 'n-1' disks involve?
Show hintHide hint
Consider the rules of disk movement.
3Question 3.
What is the formula for the number of moves needed to transfer n disks?
- M(n) = n
- M(n) = 2^n + 1
- M(n) = 2^n - 1
Show hintHide hint
Consider how each move doubles the previous steps.
4Question 4.
True or False: You can place a larger disk on top of a smaller disk in the Towers of Hanoi.
- True
- False
Show hintHide hint
Think about the rules governing disk placement.
Question 5.
Analyze Tower of Hanoi with 6 disks. If the time taken for one move is 2 seconds, how long will it take to complete all moves?
Show hintHide hint
Use the formula for moves and multiply by time taken for each move.
Question 6.
Create your own recursive algorithm similar to Towers of Hanoi with different rules. Explain the base case and recurrence.
Show hintHide hint
Make sure to outline your rules clearly before applying the recursive strategy.

6 more questions in this section. Enroll free to practise them all.