Given fixed memory partitions with variable sizes of 550K, 300K, 200K,

1.	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 placeprocesses of 430K, 312K, 517K, 95K and 226 K (in order)? Which algorithm makes themost efficient use of memory?
Answer» ANSWER: jshsyssyshjwwijshxhwjqannasg

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 placeprocesses of 430K, 312K, 517K, 95K and 226 K (in order)? Which algorithm makes themost efficient use of memory?

Answer»

jshsyssyshjwwijshxhwjqannasg