Computer Sciences > Gate 2017 Set-1 > Page Replacement Algorithm
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:
Which of the following is CORRECT?
S1: Random page replacement algorithm (where a page chosen at random is replaced)
suffers from Belady’s anomaly.
S2: LRU page replacement algorithm suffer from Belady’s anomaly .
S2: LRU page replacement algorithm suffer from Belady’s anomaly .
Which of the following is CORRECT?
Explanation
Correct : b
Similar Questions
What is the worst-case time complexity of insertion in an AVL tree?
Which operations on a binary search tree have O(h) complexity?
Compare search complexities of sorted array vs balanced BST.