You are asked to allocate a file according to either a File Allocation Table (FAT) or multi-level indexed allocation (UNIX inode - triply indirect). Assume that: - the file is 2000 disk blocks long, - there are 4 Â KB per disk block, - each pointer in the FAT occupies 4 bytes, - the first index block contains 15 entries (of which 12 are direct, and one each is singly indirect, doubly indirect, and triply indirect-see slides or textbook), - every other index block contains 15 entries (may be indirect depending on the nesting level), - each index block entry takes 4 bytes, - unused index blocks don't count in the total memory cost, though unused entries in partially filled index blocks do count. ?
a. FAT file system?

 b. UNIX-style file system? Now suppose that you wish to read the 1099 'th block of the file. Assume each of the following counts as one search operation: - moving from one element to the next in a linked list - indexing into an index block - moving from index block to the next How many searches are needed to read block 1099 when using the 

c. same FAT file system as above? 

d. same UNIX-style file system as above?

Answer rating: 100% (QA)

a Total memory cost for a 2000block file in a FAT file system Data blocks 2000 blocks 4 KBblock 8000 ... View the full answer