Question: Compare the bit map and hole list methods for keeping track of free space on a disk with 8 0 0 cylinders, each one having
Compare the bit map and hole list methods for keeping track of free space on a disk with cylinders, each one having tracks of sectors How many holes would it take before the hole list would be larger than the bit map? Assume that the allocation unit is the sector and that a hole requires a bit table entry.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
