Suppose a file system can have three disk allocation strategies, contiguous, linked, and indexed. We have just read the information for a file from its parent directory. For contiguous and linked allocation, this gives the address of the first block, and for indexed allocation this gives the address of the index block. Now we want to read the 10th data block into the memory. How many disk blocks (N) do we have to read for each of the allocation strategies?

Question

Computers and Technology

Bailey Ho

17 November, 08:16

Suppose a file system can have three disk allocation strategies, contiguous, linked, and indexed. We have just read the information for a file from its parent directory. For contiguous and linked allocation, this gives the address of the first block, and for indexed allocation this gives the address of the index block. Now we want to read the 10th data block into the memory. How many disk blocks (N) do we have to read for each of the allocation strategies?

+1

Answers (1)

Know the Answer?

Hayden Freeman · Answer 1

Since we are using three disk allocation strategies, continuous linked and indexed, therof to process and read allocation strategies we need 99830 disk blocks.