Question: Contiguous Memory Allocation Consider the dynamic memory layout shown below (the shaded blocks are already allocated). Draw to what the free memory layouts would be
Contiguous Memory Allocation
Consider the dynamic memory layout shown below (the shaded blocks are already allocated). Draw to what the free memory layouts would be after satisfying requests for (in order) memory blocks of size 195K, 410K, 262K, and 385K.
| 500 KB | 600 KB | 590 KB | 700 KB | 480 KB |
- Draw one memory layout for the worst-fit, best-fit algorithm, and one for first-fit.
- Which algorithm makes the efficient use of the memory? Why?
- Also indicate which type of fragmentation will occur and why?
Step by Step Solution
3.46 Rating (159 Votes )
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
