This is a list of some practice questions and problems for this week's
quiz. I encourage you to first, read the sections, and then try review
problems in the book. When that is complete, you should try these
problems and understand their solutions. This set of quiz questions is
not a complete list (and some of the questions are half-formed, so
there is no guarantee that any of these will appear on the
quizzes). 

This quiz covers chapter 8.


1) What is a recursive function?

2) What are the base cases of a recursive function?

3) What is the 'winding up' and 'winding down' of a recursive
   function?

4) How is the stack used in recursive functions?

5) How do you prove that a recursive function is correct?

6) Is recursion faster than iteration? Explain.

7) What is the difference between recursion and iteration.

8) Write code for this recursive function . . .

9) What is the output of the following code . . .

10) What is stack overflow in recursive functions?

11) Can all recursive functions be rewritten iteratively? 

12) What is necessary to re-write all recursive functions iteratively?