Quiz submission record for quiz2-1-1 at Sun Jun 27 22:23:12 2004:

Your Answer for Question 1:
A and B are the true statements.  Statement A can happen if an entire free block is allocated and B can occur when only part of the free block is necessary to fill the request.  Statement C is not possible because free blocks are never split to create more than was present.

Your Answer for Question 2:
Statements B and C are true.  Statement A is not always true because the freed block may combine with a neighboring block and not increase the number of blocks.  B is true because the freed block can combine with one other free block and not increase the total count.  C is true because the freed block can at most combine with the two free blocks on both sides and decrease the total count of free blocks.  Statement D is not possible because one would have to combine the freed block with three other blocks.

Your Answer for Question 3:
The Java equivalent to malloc in C is new.  There is no Java equivalent to free because it is performed automatically.  It is nearly impossible to build an automatic memory allocation/deallocation system for C because C allows the programmer a great deal of freedom in programming with pointers.  Java is able to have automatic memory management because it is much more strict in what the programmer can and cannot do.

Your Answer for Question 4:
This structure cannot be reclaimed using the reference count method because this is a circular structure.  A mark and sweep method would be able to reclaim this structure because it is able to get to every node.

Your Answer for Question 5:
I found the reading somewhat difficult because of the visualization required in understanding how a computer's memory works.  I found that I had to reread some sections several times to understand it.


Your unique submission ID is quiz2-1-1-cs61c-ae-1088400192-2978.