A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. 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:Optimal
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: