Match List - I with List - II.

Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. (a)-(II), (b)--(I), (c)-(IV), (d)-(III)
Explanation
LRU replaces the page unused longest; demand cleaning writes a page out only when it is chosen for replacement; long-term scheduling adds processes to the pool to be executed; medium-term scheduling decides how many processes are partly or fully in memory.
More System Software and Operating System questions
- Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R. Assertion A: I/O protection is ensure…
- Consider the following statements: S1: LRU page replacement algorithm suffers from the belady's anomaly S2: Shortest remaining time first s…
- Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R . Assertion A: A process involves a li…
- Given below are two statements: Which of the following statement/s is/are correct with respect to virtual memory Statement I: Address trans…
- Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R . A virtual memory system uses first-i…
- Consider three processes: P0 (arrival 0 ms, burst 7 ms), P1 (arrival 1 ms, burst 3 ms), P2 (arrival 2 ms, burst 7 ms). Pre-emptive shortest…