For the page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 with 3 page frames (initially empty), which page replacement algorithm produces the minimum number of page faults?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. (D) Optimal
More System Software and Operating System questions
- Which of the following is incorrect for virtual memory?
- A memory management system has 64 pages with a page size of 512 bytes. Physical memory consists of 32 page frames. The number of bits requi…
- Consider the page-reference string: 0 1 2 3 0 1 4 0 1 2 3 4. If the FIFO page-replacement algorithm is used, find the number of page faults…
- Indexed/grouped allocation (of disk blocks to a file) is useful because: (A) It supports both sequential and direct access. (B) The entire…
- A moving-head disk has 200 tracks, numbered 0 to 199. The head has just finished a request at track 125 and is currently at track 143 (so i…
- A disk head is currently at cylinder 50. The pending requests, in the order they arrived, are for cylinders: 4, 34, 10, 7, 19, 73, 2, 15, 6…