#### Before you keep reading...

Runestone Academy can only continue if we get support from individuals like you. As a student you are well aware of the high cost of textbooks. Our mission is to provide great books to you for free, but we ask that you consider a $10 donation, more if you can or less if $10 is a burden.

#### Before you keep reading...

Making great stuff takes time and $$. If you appreciate the book you are reading now and want to keep quality materials free for other students please consider a donation to Runestone Academy. We ask that you consider a $10 donation, but if you can give more thats great, if $10 is too much for your budget we would be happy with whatever you can afford as a show of support.

# Discussion Questions

Draw a call stack for the Tower of Hanoi problem. Assume that you
start with a stack of three disks.

Using the recursive rules as described, draw a
Sierpinski triangle using paper and pencil.

Using the dynamic programming algorithm for making change, find the
smallest number of coins that you can use to make 33 cents in change.
In addition to the usual coins assume that you have an 8 cent coin.

You have attempted

of

activities on this page