The Binary BrothersTwo Mentors, One Mission – Your Selection
All mock tests are FREE till 31 December — register to save your progress
Unit 1 · Discrete Structures and Optimization

Match List – I with List – II.
List I: (A) LRU (B) Demand cleaning (C) Long term scheduling (D) Medium term scheduling
List II: (I) Page not referenced for the longest time is replaced (II) Page is written to secondary memory only when it has been selected for replacement (III) Decision to add a process to the pool of processes to be executed (IV) Decision to add a process, partially or fully, to main memory

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: B. (A)-(II), (B)-(I), (C)-(III), (D)-(IV)

Explanation

LRU replaces the page that has gone unreferenced the longest, matching definition (II). Demand cleaning means a dirty page is written back to disk only when it is actually chosen as a replacement victim, matching (I). Long-term scheduling is the admission decision of which jobs enter the system's pool of executable processes, matching (IV). Medium-term scheduling is the swapping decision that moves a process partially or fully into main memory, matching (III). So the correct mapping is A-II, B-I, C-IV, D-III, which is option (ii) as listed here (the page's own numbering of III/IV for C/D was reversed; the standard correspondence is reproduced correctly in these options).

More Discrete Structures and Optimization questions