Using a Recursive Algorithm to Solve the Tower of Hanoi

question 20

Multiple Choice

Using a recursive algorithm to solve the Tower of Hanoi problem, a computer that can generate one billion moves per second would take ____ years to solve the problem.

• A) 39
• B) 400
• C) 500
• D) 10,000

---

Definitions:

Deoxyribose Sugar

A five-carbon sugar molecule that is a component of DNA molecules.

Hydrogen Bonds

Weak bonds that occur when a hydrogen atom in one molecule is attracted to an electronegative atom in another molecule.

Semiconservative Replication

The method by which DNA is replicated in all known cells, where each of the two strands of the DNA molecule serve as a template for the production of the complementary strand.

Hydrogen Bonds

Weak bonds between molecules or within molecules that result from an electrostatic attraction between a hydrogen atom, which is covalently bonded to a more electronegative atom, and another electronegative atom.