Question 1: Consider the Tower of Hanoi problem for the number of disks n 64. Fo

Question

Question 1: Consider the Tower of Hanoi problem for the number of disks n 64. For a computer with processor speed 2 GHz, how long will it take to solve this problem? Question 2: Consider a Stack of n integers where n> 2. Using Push (item), Pop0, and Top O functions, call the sequence of functions to remove the third from the top item of below). Note that Top 0 returns the top item from the stack while Pop) removes the top item from the stack. Here is an example. Current Stack 12 14 10 23 17 12 14 23 17

Explanation / Answer

Answer (1) - Total Number of discs given (n) = 64

                  Number of moves = 2^n - 1 = 2^64 - 1 = 18,446,744,073,709,600,000

                  Time taken = Number of moves / 31,536,000 years = Approx. 584,942,417,355 years

Answer (2) - Following is the sequence of functions to remove the third element from the top item of the stack. Lets consider the given stack as S1 and take 1 additional stack as S2.

pop(S1) to S2

pop(S1) to S2

pop(S1)

push(S2) to S1

push(S2) to S1

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.