Consider a virtual page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3,…
UGC NET 2017
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
Attempted by 82 students.
Sign up free to check your answer
Sign up freeLoading lesson…

