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)
Joe is trying to em "study" for an Exam for second year computer science at strathclyde university in glasgow. the exam is in 3hrs and 24 minutes as of this post, the questions are all from past papers of the last 2 years exams.