How many page faults occur with the optimal algorithm for the reference string 1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8 with four frames?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. 8
Explanation
1, 2, 3, 4 fault (4). 5 replaces 2 (never used again) (5). 3, 4, 1 hit. 6, 7 and 8 each fault, replacing pages not used again (8). 7, 8 hit. Total 8.More System Software and Operating System questions
- The degree of concurrency of thread models can be arranged as:
- Which of the following statements are true? A. If the time quantum is extremely small, round robin can result in a large number of context…
- Processes (arrival, execution time in ms): A (0, 6), B (3, 2), C (5, 4), D (7, 6), E (10, 3). Using shortest-remaining-time-first schedulin…
- Select the correct order of basic page replacement: A. A page-replacement algorithm is used if there is no free frame B. The process is con…
- Match List I (reference bit, modify bit) with List II (enhanced second-chance algorithm)List I List II A. (reference = 0, modify = 0) I. Mu…
- A disk has 300 cylinders (0 to 299). The read-write head is at cylinder 101, moving towards the higher end. Calculate the total head moveme…