wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Which paging algorithm is better

A
FIFO is better than LRU
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
FIFO is better than Optimal page algorithm
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
LRU is better than Optimal page algorithm
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
LRU is better than FIFO
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
Open in App
Solution

The correct option is D LRU is better than FIFO
LRU (least recently used) is better than FIFO (first in first out) because LRU can be attributed to locality of reference exhibited in request sequences. They conjectured that the competitive ratio of LRU on each access graph is less than or equal to the competitive ratio of FIFO.


901394_916472_ans_c53bad1839ed43158c5d3a0dc7cda0b4.PNG

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Introduction to Services
BUSINESS STUDIES
Watch in App
Join BYJU'S Learning Program
CrossIcon