1. What is a total addressable memory space on a 32-bit machine? Why? 2. Consider a logical address space of 64 pages of 1,024words each,mapped onto a physical memory of 32 frames. How many bits are there in the logical and physical address? 3. Given five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600KB (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of 212 KB, 417 KB, 112 KB, and 426 KB (in order)? Which algorithm makes the most efficient use of memory? 4. Consider a logical address space of 32 pages with 1,024 words per page, mapped onto a physical memory of 16 frames a. How many bits are required in the logical address? b. How many bits are required in the physical address? 5. Consider a paging system with the page table stored in memory a. If a memory reference takes 200 nanoseconds, how long does a paged memory reference take? b. Add TLBs, and assume 75 percent of all page-table references are found in the TLBs, what is the effective memory reference time? (Assume that finding a page-table entry in the TLBs takes zero time if the entry is there). 6. Consider the following page reference string: 1, 2, 3, 4, 5, 2, 4, 6, 3, 5, 4, 1, 4, 1, 6, 2, 5, 4, 2, 3. How many page faults would occur if the FIFO replacement algorithm is used? All frames are initially empty. 1. Assume one frame available 2. Assume 2 frames available 3. Assume 4 frames available 4. Assume 8 frames available 7. Consider the following page reference string: 1, 2, 3, 4, 5, 2, 4, 6, 3, 5, 4, 1, 4, 1, 6, 2, 5, 4, 2, 3. How many page faults would occur if the LRU replacement algorithm is used? All frames are initially empty 1. Assume one frame available 2. Assume 2 frames available 3. Assume 4 frames available 4. Assume 8 frames available 8. Consider the following page reference string: 1, 2, 3, 4, 5, 2, 4, 6, 3, 5, 4, 1, 4, 1, 6, 2, 5, 4, 2, 3. How many page faults would occur if the FIFO replacement algorithm is used? All frames are initially empty. 1. Assume one frame available 2. Assume 2 frames available 3. Assume 4 frames available 4. Assume 8 frames available 9. Consider a system with 64 free frames (1 KB each) and two processes running, one of 15 KB, another of 105 KB. How many more frames will be allocated to the second process if proportional allocation is used instead of equal? 10. Assume that we have a demand-paged memory. The page table is held in registers. It takes 6 ms to handle a page fault if an empty frame is available or if the replaced page is not modified and 15 ms if the replaced page is modified. Memory access time is 80 ns. Assume that 75% of pages are modified. what is the max acceptable page-fault rate for an effective access time to be below 200 ns