in Unknown Category edited by
222 views
1 vote
1 vote

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.

  1. FIFO
  2. LIFO
  3. LRU
  4. Optimal
in Unknown Category edited by
by
222 views

Please log in or register to answer this question.

Answer:

Related questions