CS 2401 Quiz Based on Test #2

Date: Wednesday, April 6, 2011.

Name: ___________________________________________________________________

4. Explain the general algorithm for solving the Hanoi tower problem. Draw, step-by-step, the solution to the Hanoi Tower problem for the case when we have three disks.

8. Show, step-by-step, how, by using stacks, we can convert the expression (3 + 29) / (20 - 11) into a postfix form. For extra credit: write a code for implementing a stack as as linked list, and for pushing and popping.