Scribd
Upload
9 views1 page

OS Assignment 4

The document is an assignment for an Operating System course at the University of Management and Technology, focusing on page replacement algorithms. It contains two tasks that require calculating the number of page faults using LRU, FIFO, and Optimal replacement methods for given page reference strings with different frame sizes. The total marks for the assignment are 20, and it is intended for the Fall 2024 session.

Uploaded by

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

OS Assignment 4

The document is an assignment for an Operating System course at the University of Management and Technology, focusing on page replacement algorithms. It contains two tasks that require calculating the number of page faults using LRU, FIFO, and Optimal replacement methods for given page reference strings with different frame sizes. The total marks for the assignment are 20, and it is intended for the Fall 2024 session.

Uploaded by

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

Operating System, V9, Assignment 4

University of management and Technology


Name: ------------------------------ Session: Fall 2024
Roll No: ---------------------------- Total Marks: 20

Operating System V9, (CLO 3)

Task 1: Consider the following page reference string:


 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.
How many page faults would occur by applying the following replacement algorithms,
assuming three and seven frames?
Remember that all frames are initially empty, so your first unique pages will cost one fault
each.
 LRU replacement
 FIFO replacement
 Optimal replacement
Task 2: Consider the following page reference string:
 7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0, 1.
Assuming demand paging with three frames, how many page faults would occur by applying
the following replacement algorithms?
 LRU replacement
 FIFO replacement
 Optimal replacement

You might also like