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
A palindrome is a word that reads the same forwards and backwards. In a game of words, a player has the following two plates painted with letters. From...
#1 MCQ
Which number does not belong in the series below? 2, 5, 10, 17, 26, 37, 50, 64
#4 MCQ

Related Topics

page replacement algorithms GATE computer science 2016 page fault rate increase LRU algorithm FIFO algorithm optimal page replacement least recently used first in first out most recently used computer science gate

Unique Visitor Count

Total Unique Visitors

Loading......