Q. Presume that you have a page-reference string for a process with m frames (initially all empty). The page-reference string has length p along with n distinct page numbers occur in it. Answer these questions for any of page replacement algorithms:
a. What is the lower bound on the numeral of page faults?
b. What is the upper bound on the numeral of page faults?
Answer:
a. n
b. p