Register

Difference between page replacement policies

687 views

1 Answer

Best answer
5 5 votes

FIFO : जो पहले आएगा वो पहले बाहर निकलेगा, example operations in a Queue.

LIFO : जो सबसे आखिर में आएगा वो पहले बाहर निकलेगा, example operations on a Stack

• selected by
Voting & Accepting an answer helps improve the community
← Previous · If X and Y are two s...Next → · Question on CPU sche...
← Previous in category · fork() system callNext in category → · Question on CPU sche...
Position:
Show:

Related questions

4 4 votes
1 1 answer
175
175 views
GO Classes asked Aug 26
175 views
GO Classes DPP | GATE CS | Operating System | Page Replacement
A demand-paging system has $3$ physical page frames.Consider the reference string:$\text{A, B, C, D, B, A, B, A, D, C}$Starting with empty memory, determine the total num...
2 2 votes
2 2 answers
165
165 views
GO Classes asked Aug 13
165 views
GO Classes DPP | GATE CS | Operating System | LRU Page Replacement
A virtual-memory system uses the LRU page-replacement algorithm.There are four physical page frames at hexadecimal addresses:$4000,\ 5000,\ 6000,\ 7000$The page-reference...
2 2 votes
1 1 answer
143
143 views
GO Classes asked Aug 13
143 views
GO Classes DPP | GATE CS | Operating System | Page Replacement
Which of the following statements about page-replacement policies are correct?LRU always produces fewer page faults than FIFO. OPT always performs at least as well as LRU...
3 3 votes
2 2 answers
193
193 views
GO Classes asked Aug 11
193 views
GO Classes DPP | GATE CS | Operating System | FIFO Page Replacement
In a virtual-memory system, the FIFO page-replacement algorithm is used.The virtual-page reference string is : $1,\ 4,\ 2,\ 4,\ 1,\ 3$There are $3$ page frames.After the ...