Arts & Literature3 mins ago
Computer Architecture - Mips
Given five 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 processes of 212 KB, 417 KB, 112 KB, and 426 KB (in
order)? Which algorithm makes the most efficient use of memory?
(7 marks)
600 KB (in order), how would each of 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?
(7 marks)
Answers
Best Answer
No best answer has yet been selected by Joe111. Once a best answer has been selected, it will be shown here.
For more on marking an answer as the "Best Answer", please visit our FAQ.