Question: Consider a file system that uses file allocation tables (FAT). Assume that the whole FAT can be stored in one block. How many disk accesses

Consider a file system that uses file allocation tables (FAT). Assume that the whole FAT can be stored in one block. How many disk accesses are required in order to delete a file? Assume that the free-list is implemented as a linked list and that the directory and the free-list pointer are stored in memory.

a. It depends on the number of blocks the file contains

b. 2

c. 3

d. 4

e. 5

the answer is a but i was wondering why

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!