UGC-NET | UGC-NET CS 2017 Nov – III | Question 50

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.

(A) FIFO
(B) LIFO
(C) LRU
(D) Optimal


Answer: (D)

Explanation: page (3)

  1. In FIFO algorithm 15 page fault will occur.
  2. page (5)

  3. In LIFO algorithm 11 page fault will occur.
  4. page (6)

  5. In LRU algorithm 12 page fault will occur.
  6. page (4)

  7. In optimal algorithm 9 page fault will occur.

So, option (D) will be correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

1


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.