The bitmap requires B bits. The free list requires DF bits. The free list requires

fewer bits if DF $<$ B$.$ Alternatively, the free list is shorter if F$/$B $<1/$D$,$

where F$/$B is the fraction of blocks free. For $16-$bit disk addresses, the free list

is shorter if $6\%$ or less of the disk is free.