Computer Science 361.01

Computer Organization

Fall 2003

Homework 2: Due Thursday, September 11^th

50 points

Please do individually and begin early.

1.(10 points)

Do #7 on page 75 by hand.

2.(10 points)

Do #8 on page 75 by hand.

3.(20 points)

Do #2(e) and #3(e) on page 74 after having read the solutions (in the back of the

book) to 2(a) and 3(a).

4.(10 points)

Write a C++ program that solves the Towers of Hanoi problem, as suggested in #10, page 76. Make a conjecture as to how many single disk moves are required to solve the problem for n disks.