Institutt for Informatikk
Universitetet i Bergen
I 125 - Innføring i Programoversettelse

Voluntary Exercise Set 9 (Gruppeøvelser. 9)

1. Exercise 7.1 on page 388 of the text.

2. Exercise 7.4 on page 389 of the text.

3. Exercise 7.5 on pages 389-390 of the text.

4. Suppose that a circular linked-list implementation of the runtime heap storage is that shown in the picture below. Show how the heap would change after each of the following calls.
   1. allocate(40)
   2. allocate(20)
   3. free(C)
   

5. Exercise 7.15 on page 394 of the text.