Consider the following page reference string: 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6 What are the last pages in main memory in their order, and how many page faults would occur for the following page replacement algorithms? Assuming 4 frames.
A) FIFO
B) Optimal
C) LRU
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here