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

Voluntary Exercise Set 9 (Group meeting 15.11.2004)

  1. 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)

  2. Exercise 7.16 on page 394 of the text.