edited by
757 views
1 votes
1 votes

Consider five memory partitions of size $100 \text{ KB }, 500 \text{ KB }, 200 \text{ KB }, 450 \text{ KB and } 600 \text{ KB }$ in same order. If sequence of requests for blocks of size $212 \text{ KB }, 417 \text{ KB }, 112 \text{ KB }, 426 \text{ KB and } 280 \text{ KB }$ in same order come and partitioning can be done in block, then which of the following algorithm satisfy all the block requests?

  1. Best Fit algorithm
  2. First Fit algorithm
  3. Both next fit and best fit results in same
  4. None of the above

 Answer given by ME: Option $(B)$

My answer: Option $(D)$

edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
3 answers
1
2 votes
2 votes
2 answers
2