2010 June UGC NET Paper 1
November 25, 2023Image-Processing
November 25, 2023NTA-UGC-NET 2021 Dec & 2022 June Paper-2
|
Question 4
|
Match List I with List II:
List I List II
(A) Least frequently used (I) Memory is distributed among processors
(B) Critical Section (II) Page replacement policy in cache memory
(C) Loosely coupled multiprocessor system (III) Program section that once begin must complete execution before another processor access the same shared resource
(D) Distributed operating system organization (IV) O/S routines are distributed among available processors.
Choose the correct answer from the options given below:
List I List II
(A) Least frequently used (I) Memory is distributed among processors
(B) Critical Section (II) Page replacement policy in cache memory
(C) Loosely coupled multiprocessor system (III) Program section that once begin must complete execution before another processor access the same shared resource
(D) Distributed operating system organization (IV) O/S routines are distributed among available processors.
Choose the correct answer from the options given below:
|
(A)-(III), (B)-(II), (C)-(IV), (D)-(I)
|
|
|
(A)-(I), (B)-(II), (C)-(III), (D)-(IV)
|
|
|
(A)-(II), (B)-(III), (C)-(I), (D)-(IV)
|
|
|
(A)-(II), (B)-(I), (C)-(III), (D)-(IV)
|
Question 4 Explanation:
A Page replacement algorithm is an algorithm that decides which pages should be written to disk or file, when a new page needs to be allocated.
Page replacement happens when a requested page is not in memory (page fault) and a free page cannot be used to satisfy the allocation, either because there are none, or because the number of free pages is lower than some threshold.
FIFO,LRU and optimal are examples of Page replacement algorithms
Critical section is a program section that once begin must complete execution before another processor accesses the same shared resource.
Page replacement happens when a requested page is not in memory (page fault) and a free page cannot be used to satisfy the allocation, either because there are none, or because the number of free pages is lower than some threshold.
FIFO,LRU and optimal are examples of Page replacement algorithms
Critical section is a program section that once begin must complete execution before another processor accesses the same shared resource.
Correct Answer: C
Question 4 Explanation:
A Page replacement algorithm is an algorithm that decides which pages should be written to disk or file, when a new page needs to be allocated.
Page replacement happens when a requested page is not in memory (page fault) and a free page cannot be used to satisfy the allocation, either because there are none, or because the number of free pages is lower than some threshold.
FIFO,LRU and optimal are examples of Page replacement algorithms
Critical section is a program section that once begin must complete execution before another processor accesses the same shared resource.
Page replacement happens when a requested page is not in memory (page fault) and a free page cannot be used to satisfy the allocation, either because there are none, or because the number of free pages is lower than some threshold.
FIFO,LRU and optimal are examples of Page replacement algorithms
Critical section is a program section that once begin must complete execution before another processor accesses the same shared resource.
Subscribe
Login
0 Comments