Given reference to the following pages by a program 0, 9, 0, 1, 8, 1, 8, 7, 8, 7, 1, 2, 8, 2, 7, 8, 2, 3, 8, 3 How many page faults will occur if the program has three page frames available to it and uses an optimal replacement?

Given reference to the following pages by a program 0, 9, 0, 1, 8, 1, 8, 7, 8, 7, 1, 2, 8, 2, 7, 8, 2, 3, 8, 3 How many page faults will occur if the program has three page frames available to it and uses an optimal replacement? Correct Answer 7

The theoretically optimal page replacement algorithm when a page needs to be swapped in, the operating system swaps out the page whose next use will occur farthest in the future. For example, a page that is not going to be used for the next 10 seconds will be swapped out over a page that is going to be used within the next 5 seconds.

0, 9, 0, 1, 8, 1, 8, 7, 8, 7, 1, 2, 8, 2, 7, 8, 2, 3, 8, 3

F, F, H, F, F, H,H ,F,H, H, F,H, H,H, H,H, H,F, H, H

Related Questions