Follow Us :

Nov2017 cs Q50

0. Consider a virtual page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Suppose a demand paged virtual memory system running on a computer system such that the main memory has 3 page frames. Then __________ page replacement algorithm has minimum number of page faults.

  • Option : D
  • Explanation :
    Nov2017 cs
    1. In FIFO algorithm 15 page fault will occur.
    Nov2017 cs
    2. In LIFO algorithm 11 page fault will occur.
    Nov2017 cs
    3. In LRU algorithm 12 page fault will occur.
    Nov2017 cs
    4.In optimal algorithm 9 page fault will occur.
    So, option (D) will be correct.
Cancel reply
Cancel reply