Question: New question: Assume that you have a page-reference string for a process with m frames (initially all empty). The page-reference string has length p, and
New question:
Assume that you have a page-reference string for a process with m frames (initially all empty). The page-reference string has length p, and n distinct page numbers occur in it. Answer these questions for any page-replacement algorithms:
a. What is a lower bound on the number of page faults?
b. What is an upper bound on the number of page faults?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
