Question

Which of the following statements about finding a block in an explicit free list is true? Select all that apply

1.Using the first-fit algorithm on a free list that is ordered according to decreasing block size results in low performance for allocations, but avoids internal fragmentation.

2.For the best-fit method, the ordering in the list of free blocks does not matter from a correctness standpoint.

3.The best-fit method chooses the smallest free block into which the requested segment fits.

4.Using the first-fit algorithm on a free list that is ordered according to decreasing block sizes is equivalent to using the best-fit algorithm.

Answer 1

1 Using first fit algorithm on a free list that is ordered according to decreasing block sizes will result in the allocation of largest free block available. Since this process chooses the largest free block, there will be large internal fragmentation.

So this option is False

2 Best fit algorithm searches for the smallest free block in the entire list so ordering won't matter.

So this option is True

3 Best fit algorithm allocates the smallest free block in the list.

  So this option is True

4 Using first fit algorithm on a free list that is ordered according to decreasing block sizes will result in the allocation of largest free block available. So this will be equivalent to using worst-fit algorithm

So this option is False