Question: 3. (15 pts) Dynamic Memory Management: A dynamic memory allocator uses a linked list to track free blocks. Assume that the free list contains just

3. (15 pts) Dynamic Memory Management: A dynamic memory allocator uses a linked list to track free blocks. Assume that the free list contains just two blocks, of size 10 and 16 bytes, in that order. Ignore any space required for bookkeeping overhead. Make a check mark to indicate which sequence of malloc() calls would succeed using each of the following algorithms: First Fit, Best Fit, Worst Fit, and Optimal. Assume that each sequence of calls starts with a free list with blocks of size 10 and 16 bvtes Hint: the first row is completed for you Sequence Of Calls 8, 12 11, 4, 10 11, 4. 6, 5 8, 5, 8. 5 8, 8, 5,5 8, 5, 6, 8 First Fit Best Fit Worst Fit Optimal
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
