題組內容

3. Assume a page reference string for a process with m frames (initially all empty). The page reference string has length n with p distinct page numbers occurring in it. For any page-replacement algorithms,

(a) What is a lower bound on the number of page faults?