The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+14 votes
1.6k views

Consider the virtual page reference string

$\text{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 $\text{LRU}$, $\text{FIFO}$ and $\text{OPTIMAL}$ denote the number of page faults under the corresponding page replacement policy. Then

  1. $\text{OPTIMAL} < \text{LRU} < \text{FIFO}$
  2. $\text{OPTIMAL} < \text{FIFO} < \text{LRU}$
  3. $\text{OPTIMAL} = \text{LRU}$
  4. $\text{OPTIMAL} = \text{FIFO}$
asked in Operating System by Veteran (359k points)
edited by | 1.6k views

2 Answers

+13 votes
Best answer

Page fault for LRU $=9$, FIFO $=6$, OPTIMAL $=5$

Answer is (B).

answered by Loyal (6.1k points)
edited by
+3 votes

Option :- B

answered by Loyal (8.1k points)
Answer:

Related questions



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

41,065 questions
47,661 answers
147,309 comments
62,381 users