Question: 1. Suppose a program references pages in the following sequence ACBDBAEFBFAGEFA Suppose the computer on which this program is running has 4 pages of physical

 1. Suppose a program references pages in the following sequence ACBDBAEFBFAGEFA

1. Suppose a program references pages in the following sequence ACBDBAEFBFAGEFA Suppose the computer on which this program is running has 4 pages of physical memory (initially no page in physical memory) (1) How many page faults will occur when using LRU page replacement algorithm? What pages are left in physical memory when it finishes? (2) Repeat above problem by using optimal page replacement algorithm

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!