Exercises

$17\mathrm{.}1$ For these questions, refer to the examples that appear in the chapter.

a$.$ HowmanycallstoRunningSumaremadeforthecall RunningSum$(10)?$

b$.$ HowaboutforthecallRunningSum$($n$)?$Giveyouranswerinterms of n$.$

c$.$ How many calls to MoveDisk are made in the

Towers of Hanoi problem if the initial call is MoveDisk$(4,1,3,2)?$ This call plays out a four$-$disk game.

d$.$ Howmanycallsaremadeforann$-$diskgame?

e$.$ How many calls to Fibonacci $($see Figure $17\mathrm{.}13)$ are made for the

initial call Fibonacci$(10)?$

f$.$ How many calls are required for the nth Fibonacci number?

g Is a square with a $$P$$ ever encountered at line $12$ of the ExitMaze

code?