0
$\begingroup$

If the string of N requests is repeated many times, which of the following is/are true?

  • I. The fewest page faults occur when M ≥ N.
  • II. LRU (least-recently-used) and FIFO (first-in-first-out) will always result in the same number of page faults.

  • III. LIFO (last-in-first-out) will always result in the fewest possible page faults.

  • IV. LIFO (last-in-first-out) and optimal page replacement policy will always result in the same number of page faults. (I added from this post.)

  • V. MRU (most-recently-used) and optimal page replacement policy will always result in the same number of page faults. (I added from this post.)


My Try:

The question is from GRE (please see Question-55), I worked for string 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5 with 4 page frame and got statements (I), (II), (III) are true. But according to this post statement (V) should be correct but didn't for this example, why?

Could you please explain which of these statements is/are correct?

Thanks in advance.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.