Scribd
Upload
20 views5 pages

College of Computer Science & Information Systems: Kingdom of Saudi Arabia - Jazan University

The document outlines an assignment for an operating systems course. It includes 4 questions - performing the Banker's algorithm, calculating page faults using FIFO for a given string assuming 3 frames, calculating page faults using LRU for a given string assuming 3 frames, and calculating page faults using the optimal replacement algorithm for a given string assuming 3 frames.

Uploaded by

محمد البناء
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
20 views5 pages

College of Computer Science & Information Systems: Kingdom of Saudi Arabia - Jazan University

The document outlines an assignment for an operating systems course. It includes 4 questions - performing the Banker's algorithm, calculating page faults using FIFO for a given string assuming 3 frames, calculating page faults using LRU for a given string assuming 3 frames, and calculating page faults using the optimal replacement algorithm for a given string assuming 3 frames.

Uploaded by

محمد البناء
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/ 5

KINGDOM OF SAUDI ARABIA | JAZAN UNIVERSITY

COLLEGE OF COMPUTER SCIENCE & INFORMATION SYSTEMS


ASSIGNMENT III - 2021-2022
Academic Year 1443-1444 Semester SECOND

Course with code OPERATING SYSYTEM-COMP231 Section

Type of
Assignment-III Marks 10
Assignment

Date of
06/04/2022 Deadline 14/04/2022
Announcement

ASSIGNMENT-III
Q1. Perform the Banker Algorithm for below problem
Q2. Consider the following page reference string: 7,0,1,2,0,3,0,4,2,3,0,3,1,2,0

How many page faults would occur for the First in First out (FIFO), assuming three frames?
Q3. Consider the following page reference string: 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2

How many page faults would occur for the least recently used (LRU/LFU),

assuming three frames?

Q4. Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 3, 1, 4, 6, 3, 2, 1, 2, 3, 1

How many page faults would occur for the optimal replacement algorithm (ORA),

assuming three frames?


Name of the Course teacher Ashfaq Hussain Signature

You might also like