edited by
7,539 views
30 votes
30 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
33 votes
33 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

22.1k
views
5 answers
56 votes
go_editor asked Feb 12, 2015
22,126 views
A computer system implements a $40\;\text{-bit}$ virtual address, page size of $8\;\text{kilobytes}$, and a $128\text{-entry}$ ... process id. The minimum length of the $\text{TLB}$ tag in bits is ______.
35.1k
views
10 answers
49 votes
go_editor asked Feb 12, 2015
35,050 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 lead to a deadlock?$1$2$3$4$
15.0k
views
4 answers
48 votes
go_editor asked Feb 13, 2015
15,043 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 ... clique is any complete subgraph of a graph)A graph with bridges cannot have cycle
17.3k
views
3 answers
59 votes
go_editor asked Feb 12, 2015
17,316 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 in the main ... $(016C)_{16}$(0170)_{16}$(0172)_{16}$