PLEASE GIVE ME A SOLUTION FOR THIS PROBLEM
given memory partitions are 100k,200k,300kand 600k. How about each of the first fit, best fit and worst fit algorithms processes of 212k,417k,112k,426k. which algorithm makes the more efficient
MUNI FROM HYDERABAD INDIA
given memory partitions are 100k,200k,300kand 600k. How about each of the first fit, best fit and worst fit algorithms processes of 212k,417k,112k,426k. which algorithm makes the more efficient
MUNI FROM HYDERABAD INDIA