Question

Given fixed memory partitions with variable sizes of 550K, 300K, 200K, 470K and 650 K
(in order) how would each of the first fit, best fit and worst fit algorithms work to place
processes of 430K, 312K, 517K, 95K and 226 K (in order)? Which algorithm makes the
most efficient use of memory?

Answer 1

Answer:

sorry I forgot this answer

Answer 2

Answer

The answer of this is 310K,201K,91K