Question: Given a page request reference string of D A B C F E A F B A C H C A D B and a
Given a page request reference string of D A B C F E A F B A C H C A D B and a page table size of four, calculate how many page faults will occur with the optimal page replacement algorithm. If all pages are equally replaceable pick the first available. Show your work.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
