Computer Sciences > Gate 2016 Set-2 > Page Replacement Algorithm
In which one of the following page replacement algorithms it is possible for the page fault rate to increase even when the number of allocated frames increases?
A
LRU (Least Recently Used)
B
OPT (Optimal Page Replacement)
C
MRU (Most Recently Used)
D
FIFO (First In First Out)

Correct : Page Replacement Algorithm

Similar Questions

Recall that Belady’s anomaly is that the pages-fault rate may increase as the number of allocated frames increases. Now consider the following statements: S1...
#170 MCQ
Recall that Belady’s anomaly is that the pages-fault rate may increase as the number of allocated frames increases. Now consider the following statements: S1...
#170 MCQ
Recall that Belady’s anomaly is that the pages-fault rate may increase as the number of allocated frames increases. Now consider the following statements: S1...
#170 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......