This is an Operating Systems Question:

assume all blocks are 1000B, assume all pointers are 4B. Retrieve the block containing byte 1,000,000.?

Homework: Consider an inode-based system with the same parameters as just above, D=12, K=250, etc 1. What is the largest file that can be stored. 2. How much space is used to store this largest possible file assuming the attributes require 64B? 3. What percentage of the space used actually holds file data? 4. Repeat all the above, now assuming the file system supports a triple indirect block. 5. Remind me to do this one in class next time. Homework: 30. It has been suggested that the first part of each Unix file be kept in the same disk block as its i-node. What good would this do? Homework: Consider an inode-based system with the same parameters as just above, D=12, K=250, etc 1. What is the largest file that can be stored. 2. How much space is used to store this largest possible file assuming the attributes require 64B? 3. What percentage of the space used actually holds file data? 4. Repeat all the above, now assuming the file system supports a triple indirect block. 5. Remind me to do this one in class next time. Homework: 30. It has been suggested that the first part of each Unix file be kept in the same disk block as its i-node. What good would this do