This question is from Operating System

6 Consider the following page-reference string: 1, 2, 3, 4, 5, 1, 5, 6, 7, 1, 2, 4, 7, 6, 3, 4, 1, 2, 3, 6 How many page faults would occur for the following replacement algorithms, assuming three frames? Remember that all frames are initially empty, so your first unique pages will all cost one fault each. a) FIFO replacement. b) Optimal replacement. Consider the following segment table: Segment Base Length 0 200 446 1 2122 15 2 88 222 Compute the physical addresses for the following logical addresses? a) 0, 336 b) 1, 11 c) 2, 400 Consider a virtual address space of four pages with 1024 bytes each, mapped onto a physical memory of 64 frames. a) How many bits are used in the virtual address? b) How many bits are used in the physical address