UGC NET CSE | December 2004 | Part 2 | Question: 37

Question

In which of the following storage replacement strategies, is a program placed in the largest available hole in the memory ?

• A. Best fit
• B. First fit
• C. Worst fit
• D. Buddy

Answer 1

First fit: Allocate the first hole that is big enough.

Best fit: Allocate the smallest hole that is big enough

Worst fit: Allocate the largest hole

Hence option C is the answer

Answer 2

yes Best Fit algorithm allocates the smallest available hole to the process, worst Fit allocate the Biggest hole to the process,First fir allocate the first hole . In all the three cases ,the WORST FIT allocates the largest size hole to the process. Hence the option (C) is correct.