Scribd
Upload
39 views1 page

Fault-Page Case Study

A computer has 4 page frames with information provided about the loaded time, last access time, and R and M bits of each page frame. The document asks which page would be replaced according to 4 different page replacement algorithms: FIFO, NRU, LRU, and second chance.

Uploaded by

beter
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
39 views1 page

Fault-Page Case Study

A computer has 4 page frames with information provided about the loaded time, last access time, and R and M bits of each page frame. The document asks which page would be replaced according to 4 different page replacement algorithms: FIFO, NRU, LRU, and second chance.

Uploaded by

beter
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

l Ain University of Science and Technology

College of
Technology

Engineering

and

Information

CASE STUDY3
Course Number: 0101306
Section(s): 61

Course Title: Operating System


Instructor: Dr. Zina Houhamdi

A computer has 4 page frames. The time of loading, time of the last access and the R
and M bits for each page are shown below
page

Loaded time

126

230

120

160

Questions:
1. Which page will FIFO replace?
2. Which page will NRU replace?
3. Which page will LRU replace?
4. Which page will second chance replace?

You might also like