This diagram shows an example of memory configuration under dynamic partitioning
ID: 3675501 • Letter: T
Question
This diagram shows an example of memory configuration under dynamic partitioning, after a number of placement and swapping-out operations have been carried out. Addresses go from left to right; gray areas indicate blocks occupied by processes; white areas indicate free memory blocks. The last process placed is 2-Mbyte and is marked with an X. Only one process was swapped out after that. What was the maximum size of the swapped-out process? What was the size of the free block just before it was partitioned by X? A new 3-Mbyte allocation request must be satisfied next. Indicate the intervals of memory where a partition will be created for the new process under the following four placement algorithms: best-fit, first-fit, next-fit, and worst-fit. for each algorithm, draw a horizontal segment under the memory strip and label it clearly.Explanation / Answer
Answer for Question 1:
As per given problem statement 2MB process is need to
acquire using Dynamic Partition so 4M free space will swap out.
Answer for Question 2:
The immediate before free block space for X is 1MB
Answer for Question 3:
Based on the jobs
First Fit :
which ever process come first that will allocate the memory first
4MB---1MB----5MB----8MB----2MB---4MB---3MB
Worst Fit :
4MB---1MB----3MB----4MB----2MB---4MB---3MB