How many page faults occur for optimal algorithm for the following reference string, with four frames? 1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8
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 faults (6); 7 (7) and 8 (8) fault, replacing pages not needed again. 7, 8 hit. Total 8 faults.
More System Software and Operating System questions
- Degree of concurrency in thread can be arranged in the manner. > >
- Consider processes A (arrival 0, burst 6), B (3, 2), C (5, 4), D (7, 6), E (10, 3), times in ms. Using shortest remaining time first schedu…
- Match List I with List II
- A disk has 300 cylinders ( 0 to 299 ). If the initial position of the read-write head is at cylinder 101 , moving towards the higher end of…
- Given below are the two statements: Statement I: The main objective for using virtual memory is to increase the effective capacity of the m…
- For processes P1 (burst 8), P2 (15), P3 (10) and P4 (7), arriving in that order and scheduled FCFS, what is the average waiting time?