Extra Credit Problems for CIS 211

• Towers of Hanoi: You are given three pegs A, B, and C, and n squares of varying size. Initially the squares are stacked on peg A in order of decreasing size, the largest square on the bottom. The problem is to move the squares from peg A to peg B one at a time in such a way that no square is ever placed on a smaller square. Peg C may be used for temporary storage of squares. Write a Java method that takes n as an argument and outputs the sequence of moves. For example, here is my output when calling hanoi(3):

  move from a to b
  move from a to c
  move from b to c
  move from a to b
  move from c to a
  move from c to b
  move from a to b
  

  For extra extra credit, implement a graphical interface that shows the pegs and the moves.

• Look up the remaining paradoxes of Zeno, and write a small paragraph on each.

• Provide another implementation of the class Memory (Lab 2) following the organization in Figure 5.7 (page 182) of Schneider and Gersting.

• In the solution for lab0, we have provided a minimal driver that tests rather simple cases. Write a TestSimpleString class that thoroughly tests the SimpleString class. Extra extra credit if you find a bug in our solution.

• Design an alternative representation for Duck Machine words. You can maintain the same hierarchy but modify the internals of the classes, or you can propose a completely new representation. Discuss the rationale behind your design.