edited by
12,272 views
43 43 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}$

5 Answers

Best answer
40 40 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
0 0 votes
best fit means the tight enough in simple enough actually my words means the smallest enogh to need to allocate the part.

for 357kb small ==> 400kb,210kb small enough ==> 250kb , 468kb ==> 500kb , 491kb ==> 600kb so remaining the 200 and 300kb remains .. so ans is A
Answer:
Position:
Show:

Related questions

73 73 votes
9 answers 9 answers
34.2k
34.2k views
go_editor asked Feb 12, 2015
34,188 views
A computer system implements a $40\;\text{-bit}$ virtual address, page size of $8\;\text{kilobytes}$, and a $128\text{-entry}$ translation look-aside buffer $\text{(TLB)}...
77 77 votes
11 answers 11 answers
54.7k
54.7k views
go_editor asked Feb 12, 2015
54,727 views
A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ resources. Which one of the following values of $N$ could ...
60 60 votes
5 answers 5 answers
23.3k
23.3k views
go_editor asked Feb 13, 2015
23,275 views
In a connected graph, a bridge is an edge whose removal disconnects the graph. Which one of the following statements is true?A tree has no bridgesA bridge cannot be part ...
78 78 votes
5 answers 5 answers
28.2k
28.2k views
go_editor asked Feb 12, 2015
28,191 views
Consider a processor with byte-addressable memory. Assume that all registers, including program counter (PC) and Program Status Word (PSW), are size of two bytes. A stack...