0
7.6kviews
Discuss partition selection algorithm in brief. Give memory partition of 150k, 500k, 200k, 300k & 550k (in order), how would each of the first fit,

best fit and worst fit algorithm place the processes of 220k, 430k, 110k & 425k (in order). Which algorithm makes the most efficient use of memory?


Mumbai University > Computer Engineering > Sem 5 > Operating System

Marks: 10M

Years: May 2016

1 Answer
1
395views

Given memory partition: 150k, 500k, 200k, 300k & 550k (in order)

Process requiring spacing

220k, 430k, 110k & 425k (in order)

First Fit

  • enter image description here

The first process arrives with the requirement of 200k memory. As we search through the memory partition. The first partition which would fit in the current request …

Create a free account to keep reading this post.

and 2 others joined a min ago.

Please log in to add an answer.