1. Suppose a file system uses i-node to store block addresses for a file. If the block size is 1 KB, and each block address takes up 4 bytes. Suppose the i-node structure stores metadata about the file (accessing mode, link count, file size, times), and addresses of the 15 disk blocks.

If the 15 disk block addresses are used to store the address of the file's blocks, what's the largest possible file size in this file system?

Without changing the i-node structure's size, we can support files of size larger than the maximum size you identified above. For example, we can use one of the 15 block address fields to point to a separate disk block which stores additional block addresses. What's the largest possible file size in this case?

2. Consider a hard disk with block size of 2048 bytes (i.e., 2KB), an average seek time of 4 msec, an average rotational delay of 4 msec, and a transfer rate of 256KB/s (256 Kilobytes per second). Answer the following two questions:

What's the total delay to read a block?

Suppose a program's address space is 1GB (i.e., $2^{30) bytes), and the OS kernel loads the whole prorgram into memory before execution. Calculate the time to load the program from disk into memory.