Quiz submission record for quiz2-1-1 at Sun Jun 27 21:49:04 2004:

Your Answer for Question 1:
a. False, a successful call to malloc maybe have received a free block from the operating system which combines with an existing free block to keep the number of free blocks unchanged.
b. True, malloc may have received a block of memory larger than needed, it returns the unneeded memory into the free list and this coulde combine with another free block.  
c. True, if malloc cannot use any of the free blocks because it requires a bigger block, the operating system maybe give malloc many more blocks of memory, which may increase the number of free blocks. 

Your Answer for Question 2:
a. False, the freed block may combine with another free block to form a single bigger block.
b. True, a freed block may combine with an adajcent free block to keep the number of free blocks unchanged.
c. True, if a freed block combines with two adajcent blocks, the number of free blocks decreases by 1.
d. False, in the best case, a freed block lies adajent to two other free blocks and in this case, the number of free blocks decreases by 1.


Your Answer for Question 3:
In Java, a declaration alone will allocate memory for the variable (similar to malloc in C). In Java, memory is freed when nothing else references the object (garbage collection).  In C, there is no table of references nor a table of where memory was allocated.  The automatic garbage collection methods cannot work.

Your Answer for Question 4:
Yes, this structure can be reclaimed using the reference count method because since there are no references to the top left structure, it will be reclaimed. Then the bottom left and top right structures will be reclaimed because they have no references.  Next the bottom right structure will be reclaimed.

Yes, this stucture can be reclaimed with the mark and sweep method if the structure were not referenced by a root (if this structure stood only by itself).  Since it cannot be reached, it will be reclaimed.

Your Answer for Question 5:
The buddy system method of memory management is unclear to me. 


Your unique submission ID is quiz2-1-1-cs61c-cj-1088398144-2611.