engineering recuitment ISRO Scientist Computer Science Mock Test Operating Systems Virtual Memory Page Replacement Policy
Assume a page reference string for a process with m frames (initially all empty). The page reference string has length p with n distinct page numbers occurring in it. For any page-replacement algorithms, what is a lower bound & an upper bound on the number of page faults?
1
n / 2, p
2
p, n
3
n, p / 2
4
n, p