Functions in Arrays
Review Questions 7.10, 7.11
13. Explain partially filled arrays. 
     - Why are they useful
     - How are they used
     - What adv. and disadv. do they have over "normal" arrays

11.7 p363-364
Review Questions: p378: 11.1, 11.16, 11.17
  What is a dynamic array?
  What is the difference between dynamic and static arrays? 
  Demonstrate how to declare a dynamic array?
  How can one tell that code uses dynamic data? 
  Every new should have a delete for good programming practice.
  What is the difference between static and dynamic memory?

    - static memory goes on the stack and is bound  at compile time
  
    - dynamic memory goes on the heap, is allocated with new, released
      with delete and is bound at run time


-----------------------------------------------------------------
Chapter 17 (541-564) 
Summary: 560 
Review Questions (all but 17.12) 560-562


Additional Questions follow:
----------------------------------------------------------------

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) Is recursion faster than iteration? Explain.

6) What is the difference between recursion and iteration.

7) Write code for this recursive function . . .

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

9) What is the error in the following code . . .

10) What is stack overflow in recursive functions?

11) Can all recursive functions be rewritten iteratively? Why not or how?

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

13) What is a stack trace?

14) Demonstrate a stack trace on . . .