Question

Consider a memory layout design which has a list of given memory partitions of 100K, 500K, 200K, 300K and 600K (in order). If we allow each of the First-fit Best fit, and Worst-fit algorithms to place process of 212K, 417K, 112K, and 426K (in order), which algorithm makes the most efficient use of memory?
(1) First Fit
(2) Worst Fit
(3) Bet Fit
(4) All perform equally well

Answer 1

nknknvnn. jjkbt. nkl. jm. km jn bn bn bb hb