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 for (a) 3 page frames and (b) 4 page frames, respectively.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. (D) 9, 10
More System Software and Operating System questions
- 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…
- Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorith…
- What is called journaling in a Linux operating system?
- In a file allocation system, the following allocation schemes are used: (A) Contiguous allocation, (B) Indexed allocation, (C) Linked alloc…