edited by
7,206 views
29 votes
29 votes

Consider $6$ memory partitions of sizes $200$ $\text{KB}$, $400$ $\text{KB}$, $600$ $\text{KB}$, $500$ $\text{KB}$, $300$ $\text{KB}$and $250$ $\text{KB}$, where $\text{KB}$refers to $\text{kilobyte}$. These partitions need to be allotted to four processes of sizes $357$ $\text{KB}$, $210$ $\text{KB}$, $468$ $\text{KB}$, $491$ $\text{KB}$in that order. If the best-fit algorithm is used, which partitions are NOT allotted to any process?

  1. $200$ $\text{KB}$ and $300$ $\text{KB}$
  2. $200$ $\text{KB}$ and $250$ $\text{KB}$
  3. $250$ $\text{KB}$ and $300$ $\text{KB}$
  4. $300$ $\text{KB}$ and $400$ $\text{KB}$
edited by

3 Answers

Best answer
32 votes
32 votes

Option (A) is correct because we have $6$ memory partitions of sizes $200 \ KB, 400 \ KB, 600 \ KB, 500 \ KB, 300 \ KB$ and $250 \ KB$ and the partition allotted to the process using best fit is given below:

  • $357 \ KB$ process allotted at partition $400 \ KB.$
  • $210 \ KB$ process allotted at partition $250 \ KB$
  • $468 \ KB$ process allotted at partition $500  \ KB$
  • $491 \ KB$ process allotted at partition $600 \ KB$

So, we have left only two partitions $200 \ KB$ and $300 \ KB$

edited by
9 votes
9 votes
Ans A

Best fit policy is choose smallest big enough chunk of memory.
Answer:

Related questions

49 votes
49 votes
10 answers
2
go_editor asked Feb 12, 2015
33,804 views
A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could l...