1) What problem exists with a static allocation strategy?

2) What are the steps must a memory manager perform, if it is allocating blocks of memory using a dynamically allocation strategy?

3) What are the steps involved in reclaiming a block of memory when it is freed with dynamic allocation.

4) What is the difference between internal and external fragmentation (Exercise 8.9 in your text)

5) Explain 2 differences between logical and physical addresses. (Practice Exercise 8.1 in your text)

6) The diagram below shows a set of memory blocks, with some blocks allocated and some blocks free. Block A is at the lowest address. Assume that the last block to be allocated was block B. Four requests arrive allocate 256K, allocate 128K, free Block B and allocate 56K (in this order). Explain which blocks would be allocated to satisfy each request using the four allocation strategies discussed for dynamic memory allocation. SHOW how the contents of memory would be altered by each allocation!!!!!!! (NOTE that for all four of these strategies free memory blocks can be linked in order by increasing address)

A: 400K (free)
B: 90 K (allocated)	<- Roving Pointer to last block allocated
C: 150 K (Free)
D: 50K (allocated)
E: 200K (free)
F: 110K (allocated)
G: 300K (free)