ME OS Booklet

Question

Given memory partition in the order below:P1:100k P2:500k P3:800k P4:300k P5:600k.How would Worst Fit algo place processes :212k,417k,112k and 426k (in order)

Answer 1

Worst fit algo places the processes in such a way that the maximum possible hole is created out of the various possibilities.

Given : partition sizes-P1:100k P2:500k P3:800k P4:300k P5:600k

Process 1:212k So we will allocate it to P3(it will give us the biggest hole possible) size of hole=800-212=588k

Process2:417k it will be allocated to P5 ,hole=600-417=183.

Process 3:112k it will be allocated to the hole of P3 : new hole=588-112=476

Process 4:426k It will be allocated to P2: hole=500-426=74

order of allocation: P3 P5 P3 P2

Comments

@Soumya Tiwari what is the correct ans?

---

How could u assume that this is a dynamic partitioning

---

@Piyush mishra 

I assumed it because it was not mentioned that we cant allocate more than one process in one partition after one has already been added.

---

But when memory partitioning is given then it should be  fixed partitioning of the memory then 426k should not be in any partition.