QI\A\ Consider a UNIX file system with 12 direct pointers, 1 indirect pointer, 1 double-indirect pointer, and I triple-indirect pointer int he i-node. Assume that disk blocks are 8K bytes and that each pointer to a disk block requires 4 bytes. How many disk reads will this file system require to read location 4*10° within file /home/student/a? Assume that nothing relevant is in the file-cache (e.g., no i-nodes and no data blocks); you can assume that the root directory contains very few entries (i.e., is one block long). To assure full credit, describe each disk read.

Consider a file system on a disk that has both logical and physical block sizes of 512 bytes. Assume that the information about each file is already in memory. For each of the three allocation strategies (contiguous, linked, and indexed), answer the following question: If we are currently at logical block 10 (the last block accessed was block 10) and want to access logical block 4, how many physical blocks must be read from the disk?

c) Suppose a disk has 300 cylinders, numbered from 0 to 299. The drive is currently serving an I/O request at cylinder 111 and the disk head was previously serving a request at cylinder 99, and there is a queue of disk access requests for cylinders as below: 181, 199, 150, 160, 85, 178, 109, 75 Starting from the current head position, calculate the total head movements using the following disk scheduling algorithms.(i) SSTF scheduling (ii) SCAN scheduling

As described in COD Section 5.7 (Virtual memory), virtual memory uses a page table to track the mapping of virtual addresses to physical addresses. This exercise shows how this table must be updated as addresses are accessed. The following data constitute a stream of virtual byte addresses as seen on a system. Assume 4 KiB pages, a four-entry fully associative TLB, and true LRU replacement. If pages must be brought in from disk, increment the next largest page number. TLB Page Table (a) For each access shown above, list whether the access is a hit or miss in the TLB, whether the access is a hit or miss in the page table, whether the access is a page fault, the updated state of the TLB.   (b) Repeat Part a, but this time use 16 KiB pages instead of 4 KiB pages. What would be some of the advantages of having a larger page size? What are some of the disadvantages? (c) Repeat Part a, but this time use 4 KiB pages and a two-way set associative TLB. (d) Repeat Part a, but…