Given memory partitions of 100 K, 500 K, 200 K, 300 K and 600 K (in order) and…
2012
Given memory partitions of 100 K, 500 K, 200 K, 300 K and 600 K (in order) and processes of 212 K, 417 K, 112 K, and 426 K (in order), using the first-fit algorithm, in which partition would the process requiring 426 K be placed
- A.
500 K
- B.
200 K
- C.
300 K
- D.
600 K
- E.
None
Attempted by 69 students.
Show answer & explanation
Correct answer: E
Using the First-Fit algorithm with fixed-size partitions:
Memory partitions:
100K, 500K, 200K, 300K, 600K
Processes:
212K, 417K, 112K, 426K
Allocation:
212K is allocated to the first partition large enough, i.e., 500K.
417K is allocated to the next suitable partition, i.e., 600K.
112K is allocated to the next suitable partition, i.e., 200K.
Since fixed partitions are used, the remaining spaces inside allocated partitions become internal fragmentation and cannot be reused.
The free partitions left are 100K and 300K only. Therefore, the process of 426K cannot be allocated in any partition.
A video solution is available for this question — log in and enroll to watch it.