First Fit – allocate the first free block which is large enough to accommodate the process.
Best Fit – search the entire list of free blocks and allocate the smallest free block which is sufficient for the process.
Worst fit – search the entire list of free blocks and allocate the largest available free block such that the fragment created will be big enough to be useful.
Given five memory partitions of 100Kb, 500Kb, 200Kb, 300Kb, 600Kb (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of 212 Kb, 417 Kb, 112 Kb, and 426 Kb (in order)? Which algorithm makes the most efficient use of memory?
Given memory partition of 100 KB, 500 KB, 200 KB and 600 KB (inorder). Show with neat sketch how would each of the first-fit, best-fit and worst fit algorithms place processes of 412 KB, 317 KB, 112 KB and 326 KB (in order). Which algorithm is most efficient in memory allocation?
