Question: Reference String: 7 , 2 , 3 , 1 , 2 , 5 , 3 , 4 , 6 , 7 , 7 , 1

Reference String: 7,2,3,1,2,5,3,4,6,7,7,1,2,4,2,3,6,5,3,4,1,7,4,2,3,5,6,1,2,4,3,7,2,6,4,5,1,3,2,4,7,6,5
The amount of page frames avaliable is 5.
What is the final content of the page frames when using FIFO, LRU. How many page faults occured?
4. The optimal algorithm is easy to implement, true or false, why?
5.
The time it takes to access main memory is 300 nanoseconds, your process causes a total of 3 page faults, each page fault takes 6 milliseconds. If a total of 7000 accesses where made what is the EAT?
Reference String: 7 , 2 , 3 , 1 , 2 , 5 , 3 , 4 ,

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 Programming Questions!