Match List I with List II
| List I | List II |
|---|---|
| (a) LRU | (I) A page is written to secondary memory only when it has been selected for replacement |
| (b) Demand cleaning | (II) A page that has not been referenced for the longest time is replaced |
| (c) Long-term scheduling | (III) The decision to add to the number of processes that are partially or fully in main memory |
| (d) Medium-term scheduling | (IV) The decision to add to the pool of processes to be executed |
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 for the longest time (II). Demand cleaning writes a page out only when it is selected for replacement (I). Long-term scheduling decides which processes join the pool to be executed (IV). Medium-term scheduling decides how many processes are (partly) in main memory (III).More System Software and Operating System questions
- Arrange the following levels of interrupt protection within the Linux kernel in order of increasing priority. (a) User-mode programs (b) Bo…
- Statement (I): A thread is a dispatchable unit of work that does not execute sequentially and is not interruptible. Statement (II): It is n…
- 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: The LRU page-replacement algorithm suffers from Belady's anomaly. S2: Shortest-remaining-time-first…
- Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R. Assertion A: A process invokes a libr…
- With respect to virtual memory: Statement I: Address translation is performed for every logical address used during the execution of a prog…