In: Computer Science
Can someone show me the steps of how to solve this?
A program needs to access the following pages:
1, 2, 3, 4, 2, 1, 3, 2, 1, 4, 2, 3
There are 3 initially empty frames, how many page faults will there be respectively, if we use First-in-First-out, and Farthest-in-Future page replacement algorithms?
A) 7 and 7
B) 7 and 6 -- Correct Answer
C) 6 and 6
D) 6 and 5
The correct answer is option 1st : 7 and 7
The first- in- first -out algorithm is the simplest page replacement algorithm in which we replaces the page which are for the longest time in the frame.
The farthest in future algorithm gives the least number of page faults.
I have explain both the algorithms with the proper steps:-