Multiple choice

Consider the virtual page reference string: 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 on a demand paged virtual memory system running on a computer system that has main memory size of 3 page frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of page faults under the corresponding page replacement policy. Then

  1. OPTIMAL < LRU < FIFO

  2. OPTIMAL < FIFO < LRU

  3. OPTIMAL = LRU

  4. OPTIMAL = FIFO
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Keep practicing — related questions