finish problems

EX: 7.(2) Suppose the inode number of a file is 100005. How does the OS know where this inode is stored on disk? What data structures are accessed by the OS to compute the inode’s location on disk.

8.(10) Suppose that an inode is 256 bytes, pointers are 10 bytes long, and the status information takes up 56 bytes. Assume a block size of 4000 bytes.

    • How much room is there for direct pointers in the inode?

(b)How big a file can be represented with direct pointers?

(c)How big a file can be represented with single Indirect pointers?

(d)How big a file can be represented with Double Indirect pointers?

(e)How big a file can be represented with Triple Indirect pointers?