As always, I encourage you to look at the review questions on pages 176-178, 205-208, 242-244 and 380 Chapter 5-6 1. Give a function definition for . . . 2. Give a function prototype for . . . 3. What is pass-by-value? 4. What is pass-by-reference? 5. When is pass-by-value used? 6. When is pass-by-reference used? 7. Compare and contrast pass-by-value and pass-by-reference? 8. What is the scope of this variable? 9. Show how to call this function. 10. What is a return type? 11. What is a void function? 12. What does the following function do . . . Chapter 7 1. Demonstrate how to declare an array. 2. What is an array? 3. Demonstrate how to initialize an array. 4. Demonstrate how to set every element of an array to a specific value. 5. Demonstrate how to pass an array to a function. 6. Do arrays act like call by reference? Explain how or why. 7. Demonstrate how to access a specific element of an array. 8. What is the smallest index of an array? 9. What is the largest index of an array? 10. What happens when you "blow array bounds" or access an invalid index of an array? 11. Demonstrate code to solve the following problem with an array . . . 12. What is the output of the following program . . . 13. Demonstrate code to search an array for a specific element. 11.7 What is a dynamic array? 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 the stack and the heap? What is the difference between static and dynamic memory? - static memory goes on the stack and is established and determined at compile time - dynamic memory goes on the heap, is allocated with new, released with delete and is established and determined at run time