UGC NET CSE | October 2022 | Part 1 | Question: 59

Question

Match List I with List II :

$\begin{array}{ll} \text{List I} & \text{List II} \\ \\
\text { (A) Least frequently used } & \text { (I) Memory is distributed among processors } \\
\text { (B) Critical Section } & \text { (II) Page replacement policy in cache memory } \\
\text { (C) Loosely coupled multiprocessor } & \text { (III) Program section that once begin must} \\
\qquad \text{system}&\qquad \text {  complete execution before another processor} \\
&\qquad \text {  access the same shared resource } \\
\text{(D) Distributed operating system }  & \text{ (IV) O/S routines are distributed among }\\
\qquad \text{organization}
\end{array}$

Choose the correct answer from the options given below :

• A. $\text{(A)-(III), (B)-(II), (C)-(IV). (D)-(I)}$
• B. $\text{(A)-(I), (B)-(II), (C)-(III), (D)-(IV)}$
• C. $\text{(A)-(II), (B)-(III), (C)-(I), (D)-(IV)}$
• D. $\text{(A)-(II), (B)-(I), (C)-(Iii), (D)-(IV)}$

Answer 1

LFU is a page replacement algorithm.

Also, Critical  section is the shared resource area. To ensure mutual exclusion we wait for one process to complete first. If two processes enter in the critical section Simultaneously then there may me inconsistency and resource conflict.

In loosely coupled multiprocessor system memory is distributed amongst the processes.

OS  resources are distributed amongst various processes in distributed OS

So, option C is correct one.