[Solved] What is the Optimal page – replacement algorithm?

McqMate

Q.	What is the Optimal page – replacement algorithm?
A.	replace the page that has not been used for a long time
B.	replace the page that has been used for a long time
C.	replace the page that will not be used for a long time
D.	none of the mentioned
Answer» C. replace the page that will not be used for a long time

5.2k

0

Do you find this helpful?

30

View all MCQs in

Operating System (OS)

Discussion

No comments yet

Related MCQs

In FIFO page replacement algorithm, when a page must be replaced
A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is
LRU page – replacement algorithm associates with each page the
Segment replacement algorithms are more complex than page replacement algorithms because
A FIFO replacement algorithm associates with each page the
What is the reason for using the LFU page replacement algorithm?
In virtual memory, which is not a page replacement algorithm ?
If the size of logical address space is 2 to the power of m, and a page size is 2 to the power of n addressing units, then the high order bits of a logical address designate the page number, and the low order bits designate the page offset.
Which of the following page replacement algorithms suffers from Belady’s Anomaly?
What are the two methods of the LRU page replacement policy that can be implemented in hardware?