Question
Consider the following page reference string: A, C, D, B, A, C, E, A, C, D, B, E Suppose there are 3 frames in physical
Consider the following page reference string:
A, C, D, B, A, C, E, A, C, D, B, E
Suppose there are 3 frames in physical memory, how many page faults will occur for the following replacement algorithms:
a. FIFO Replacement algorithm: (2 marks)
b. Optimal Replacement algorithm: (2 marks)
c. LRU replacement algorithm: (2 marks)
Write your detailed answer as the following for each algorithm:
Read A: Frame1, Frame2, Frame3
Read C: Frame1, Frame2, Frame3
Read D: Frame1, Frame2, Frame3
Read B: Frame1, Frame2, Frame3
Read A: Frame1, Frame2, Frame3
Read C: Frame1, Frame2, Frame3
Read E: Frame1, Frame2, Frame3
Read A: Frame1, Frame2, Frame3
Read C: Frame1, Frame2, Frame3
Read D: Frame1, Frame2, Frame3
Read B: Frame1, Frame2, Frame3
Read E: Frame1, Frame2, Frame3
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Microsoft SQL Server 2012 Unleashed
Authors: Ray Rankins, Paul Bertucci
1st Edition
0133408507, 9780133408508
