FIFO
What does FIFO stand for in page replacement?
First-In First-Out
What does LRU stand for?
Least Recently Used
FIFO does NOT consider:
Page usage frequency
Does LRU suffer from Belady’s anomaly?
No
When using FIFO, a page fault occurs when:
Page is not in memory
In FIFO page replacement, which page is replaced first?
Oldest loaded page
In LRU page replacement, which page is replaced?
Least recently used page
In FIFO, when a page fault occurs, what happens?
Oldest page is removed
LRU replaces the page that:
Was used least recently
FIFO algorithm replaces a page when:
It has been in memory the longest
What is Belady’s Anomaly?
Increase in page faults with more frames
LRU algorithm is based on:
Past usage
Which factor is ignored by FIFO algorithm?
Frequency of use
LRU requires:
Tracking of page usage history
Which of the following scenarios best suits FIFO?
Programs with no locality of reference
FIFO page replacement is considered:
Simple
Which data structure is commonly used to implement LRU?
Stack
FIFO algorithm can be inefficient because:
It ignores usage pattern
LRU is considered:
Approximation of optimal
FIFO algorithm is also known as:
Replacement by age
FIFO is suitable for:
Systems requiring simplicity
LRU is better than FIFO because:
It considers usage pattern
FIFO is easy to implement because it uses:
Queue operations
Which of the following is a disadvantage of LRU?
High overhead for tracking usage
What happens if all frames are full in FIFO and a new page arrives?
Oldest page is replaced