The algorithm which replaces the block which has not been referenced for awhile is called ……… ans. Random Replacement FIFO Optimal Page Replacement LRU

The algorithm which replaces the block which has not been referenced for awhile is called ………ans.

[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

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

For 3 page frames, the following is the reference string: 7 2 3 2 1 3 0 6 2 3 0 4 2 1 3 2 1 7 1 8 How many page faults does the LRU page replacement algorithm produceAnswer( Please choose a correct answer )   CLEAR10151216

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