Content of reading exercise #2

1. List the various times a decision may be bound. What types of decisions are typically bound at each time?
2. Compare and contrast the three principal storage allocation mechanisms: Static, Stack, and Heap. What are each of the allocation mechanisms typically used for?
3. What are the advantages of using stack-based allocation?
4. What are two algorithms for managing space in a heap? How do they work and what are the advantages/disadvantages of each?
5. Compare static and dynamic scoping. How do they work and why would one be preferred over the other?
6. In nested subroutines, what is the simple method for the nested routine to access the frame of a surrounding scope?
7. What is the closest nested scope rule and how does it work?
8. What are modules and why are they important in the construction of software?
9. What kinds of problems might arise in a program as a result of aliasing?