Suppose we execute Cheney's copying garbage collection algorithm on each of the networks of Exercise XXXXXXXXXXAlso, suppose that  i. Each object has size 100 bytes, ii. The unscanned list is managed...

Suppose we execute Cheney's copying garbage collection algorithm on each of the networks of Exercise 7.6.1. Also, suppose that

i. Each object has size 100 bytes,


ii. The unscanned list is managed as a queue, and when an object has more than one pointer, the reached objects are added to the queue in alphabetical order, and


Hi. The From semispace starts at location 0, and the To semispace starts at location 10,000.

What is the value of NewLocation(o) for each object o that remains after garbage collection?

Exercise 7.6.1

Show the steps of a mark-and-sweep garbage collector on

a) Fig. 7.19 with the pointer A ->• B deleted.

b) Fig. 7.19 with the pointer A -> C deleted.

c) Fig. 7.20 with the pointer A-t D deleted.


d) Fig. 7.20 with the object B deleted.

Fig. 7.19

Fig. 7.20