Galvin Edition 9 Exercise 8 Question 11 (Page No. 391)

Question

Given six memory partitions of $300$ $KB$, $600$ $KB$, $350$ $KB$, $200$ $KB$, $750$$ KB$  and $125$$KB$ (in order), how would the $first-fit$, $best-fit$, and $worst-fit$ algorithms place processes of size $115$ $KB$, $500$ $KB$, $358$$KB$, $200$ $KB$, and $375$ $KB$ (in order) ? Rank the algorithms in terms of how efficiently they use memory.

Answer 1

https://www.gatevidyalay.com/contiguous-memory-allocation-practice-problems/

see full solution here..

and best fit algorithem is best suited here and worst fit has worst efficiency also causing external fragmentation of 375KB