Given memory partitions of 100 kb, 500 kb, 200 kb, 300 kb, and 600 kb (in order), how would each of the first-fit, best-fit, and worst-fit algorithms place processes of 212 kb, 417 kb, 112 kb, and 426 kb (in order)?Which algorithm makes the most efficient use of memory?© BrainMass Inc. brainmass.com October 10, 2019, 1:56 am ad1c9bdddf
For First-fit algorithm, we have:
- 212K placed in 500K partition
- 417K placed in 600K partition
- 112K is put in 288K partition, created from the space remaining in 500K partition
- 426K must wait for a large ...
This posting contains answers to the given questions.