the page faults.(c) Repeat (b) above for the LRU page replacement algorithm. (d) What would be the lowest number of page faults achievable in this example, assuming an optimal page replacement algorit

For 3 page frames, the following is the reference string: 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1. How many page faults does the LRU page replacement algorithm produce?A.12B.15C.11D.9

The sequence of pages which are to be referred by microprocessor is as follows:D,C,B,A,D,C,E,D,C,B,A,EThe number of page faults that will occur in the algorithm LRU with four page frames will be

Consider the following page reference string. 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6 For FIFO page replacement algorithms with 3 frames, the number of page faults is?a.15b.14c.11d.16

Consider main memory with a total of 2 blocks. LRU replacement policy is used for choosing the block to be replaced. The number of faults for the following sequence of block addresses 8, 12, 0, 12, 8 is _____________6453

[8, 6, 2, 2, 1, 3, 6, 8, 5, 3, 3, 0, 1] page sequence is executed on two processors with memory space of 3K and 4K each for processor A and processor B respectively. Page replacement policy takes recent usage while replacing pages in blocks. What seems to be true?10 faults are observed in 4K memory space12 faults are observed in 3K memory space2K page size is efficient than 4K memory space4K memory space is efficient than 3K memory space