Suppose we have a Unix file system with block size of 8 Kbyte and pointers with size of 4 bytes. How large a file can be represented using only single indirect pointer in inode? A. 8 Kbyte B. 2K * 8 Kbyte C. 2K * 2K * 8 Kbyte D. 2K * 2K * 2K * 8 Kbyte

Suppose that we have a magnetic disk with the following structure: Each sector is fixed at 512 bytes, and each cluster consists of 4 sectors. Given that a file has reserved 2 clusters with a slack space of 1024 bytes . a- How many sectors will the file will require? b- What will be the physical size of the file? c- What will be the logical size of the file?

Assuming 4K clustering for a 500-byte file, what is the size (in bytes) of the File Slack? O 12 bytes O 1536 bytes O 3584 bytes O 4096 bytes

Suppose a computer system uses 16-bit addresses for both its virtual and physical addresses. In addition, assume each page (and frame) has size 256 bytes. How many bits are used for the page number? How many bits are used for the offset? 8 bits each. With this system, what’s the maximum number of pages that a process can have? 256 Suppose that each entry in the page table comprises 4 bytes (including the frame number, the valid bit, and miscellaneous “bookkeeping bits”). An OS uses an array to store the page table. What is the size of the page table? 1024 Bytes Furthermore, suppose the first 6 pages of a process map to frames 222 to 227 (as decimal numbers), and the last 5 pages of the process map to frames 1 to 5 (also decimal numbers). All other pages are invalid. Draw the page table, including the valid bit and the frame number. DONE Translate the following virtual addresses to physical addresses, and show how you obtain the answers. (Hint: You do not need to convert…