Assume a page reference string for a process

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,
a. What is a lower bound on the number of page faults?
b. What is an upper bound on the number of page faults?

Members

  • Access to 2 Million+ Textbook solutions
  • Ask any question from 24/7 available
    Tutors
$9.99
VIEW SOLUTION
OR

Non-Members

Get help from Computer Engineering Tutors
Ask questions directly from Qualified Online Computer Engineering Tutors .
Best for online homework instance.