Page Replacement

Question

Consider a page reference string for a process with m frames. The length of the page reference string is p with n distinct page numbers occurring in it. For any page replacement
algorithms, What is lower and upper bound on the number of page faults?

(A) m, n

(B) p, m

(C) n, p

Answer 1

answer should be C)

BEST CASE:when frames allocated that is M is large...in that case...we will only encounter page fault at every distinct page so lower bund is N.

Worst case: say very less frames are allocated ...assume only 1 frams is allocated...here  (assume that no 2 page request are same) we may encounter page fault for every page present in refrenced string....

so worst case is P.

Comments

Ok got it. I did not understand the question properly..Thank you :).