Each student will be able to:

• Within the context of dynamic memory allocation, define memory leaks. Explain how they occur.
• Within the context of dynamic memory allocation describe the relative advantages and disadvantages of garbage collection, explicit malloc/free, and region allocation/deallocation.
• Compare and contrast mark-sweep and reference-count methods of garbage collection.
• Define fragmentation and describe how and why it occurs.
• Given a fixed size buffer, arranged in a boundary-tag paradigm for dynamic memory allocation and an ordered list of allocation and deallocation requests show the behavior of the allocation processes using each of the following heuristics.
  • first fit
  • best fit
  • worst fit