Problem: Given memory partitions of 100 KB, 500 KB, 200 KB, 300 KB and 600 KB (in order), how would each of the first-fi
Posted: Fri May 20, 2022 10:44 am
Problem: Given memory partitions of 100 KB, 500 KB, 200 KB, 300 KB and 600 KB (in order), how would each of the first-fit, best-fit and worst-fit algorithms place blocks of 212 KB, 417 KB, 112 KB and 426 KB (in this order)? Which algorithm makes the most efficient use of memory?