Consider the working set model with Δ=3. Given the followingreference string of a process p: y x x x x x x y y u x x x y z y zw w z x x w w
a) What is the largest working set process p will everhave?
b) What is the smallest working set process p will ever have (notcounting the first Δ references)?
Answer
a) largest working set process p will ever have is when all 3pages in the delta window are different i.e
y x x x x x x y y u x x x y z y
OR
OR