Question

which of the following concept is optimal page replacement algorithms based on.... a. replace the page that has not been in use of longest b. replace the oldest page in memory c. replace the page thatwill not be use for the longest period. c. none of above​

Answer 1

Answer:

LRU(Least Recently Used) Algorithm − The Least Recently used (LRU) algorithm replaces the page that has not been used for the longest period of time. It is based on the observation that pages that have not been used for long time will probably remain unused for the longest time and are to be replaced.

Explanation:

please please marks me brain last

Answer 2

Optimal page replacement algorithms are based on replacing the page that will not be used for the longest period. (option c)

• The "optimal page replacement algorithm" (OPR algorithm) is also referred to as the "Clairvoyant replacement algorithm" or "Belady’s optimal replacement algorithm".
• The idea of an OPR algorithm is the reduction of the number of faulty pages.
• The OPR algorithm satisfies the stack algorithm, thus also known as the inclusion property.
• This algorithm can be implemented in Special-Purpose OS.
• The main focus of this algorithm is based on the pages that have not been used for a long time and will probably remain unused for the longest time, thus needing to be replaced.

#SPJ2