The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+11 votes
539 views

The following page addresses, in the given sequence, were generated by a program:

$\text{1 2 3 4 1 3 5 2 1 5 4 3 2 3}$

This program is run on a demand paged virtual memory system, with main memory size equal to $4$ pages. Indicate the page references for which page faults occur for the following page replacement algorithms.

  1. LRU
  2. FIFO

Assume that the main memory is initially empty

asked in Operating System by Veteran (59.5k points)
edited by | 539 views

1 Answer

+13 votes
Best answer
LRU :  $1,2,3,4,5,2,4,3,2$
FIFO : $1,2,3,4,5,1,2,3$
answered by Veteran (55.4k points)
edited by
+4

Also number of page faults:

LRU: 9

FIFO: 8
 



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

39,749 questions
46,765 answers
140,656 comments
58,513 users