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

Choose the correct answer from the options given below :

Question

Question

This question was previously asked in

UGC NET Computer Science (Paper 2) 07 Dec 2023 Official Paper

Answer 1

The correct answer is A - II, B - I, C - IV, D - III

EXPLANATION:

A. LRU, which stands for Least Recently Used, is a page replacement algorithm. This policy replaces the page that has not been referenced for the longest time. So, LRU corresponds to II.
B. Demand Cleaning refers to the policy where a page is written to secondary memory only when it has been selected for replacement. Hence, Demand cleaning corresponds to I.
C. Long term scheduling is the decision to add to the pool of processes to be executed. So, Long term scheduling corresponds to IV.
D. Medium term scheduling is the decision to add to the number of processes that are partially or fully in main memory. So, Medium term scheduling corresponds to III.

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