search
Log In
18 votes
3.7k views

The optimal page replacement algorithm will select the page that

  1. Has not been used for the longest time in the past
  2. Will not be used for the longest time in the future
  3. Has been used least number of times
  4. Has been used most number of times
in Operating System 3.7k views
3

The optimal page replacement algorithm will select the page that - Will not be used for the longest time in the future.

And that's the reason this optimal Page replacement algorithm is not a practical one and only used for benchmarking because one can never look into future and make decisions in present and that implies in real life too otherwise life would be no fun and boring because then we all take the perfect decisions!

1 Answer

35 votes
 
Best answer

Optimal page replacement algorithm will always select the page that will not be used for the longest time in the future for replacement, and that is why the it is called optimal page replacement algorithm. Hence, (B) choice. 


edited by
Answer:

Related questions

22 votes
5 answers
1
4k views
Which of the following scheduling algorithms is non-preemptive? Round Robin First-In First-Out Multilevel Queue Scheduling Multilevel Queue Scheduling with Feedback
asked Sep 16, 2014 in Operating System Kathleen 4k views
24 votes
4 answers
2
3.4k views
Dynamic linking can cause security concerns because Security is dynamic The path for searching dynamic libraries is not known till runtime Linking is insecure Cryptographic procedures are not available for dynamic linking
asked Sep 16, 2014 in Operating System Kathleen 3.4k views
32 votes
5 answers
3
7.8k views
The maximum number of edges in a n-node undirected graph without self loops is $n^2$ $\frac{n(n-1)}{2}$ $n-1$ $\frac{(n+1)(n)}{2}$
asked Sep 16, 2014 in Graph Theory Kathleen 7.8k views
22 votes
3 answers
4
7.8k views
In the absolute addressing mode: the operand is inside the instruction the address of the operand in inside the instruction the register containing the address of the operand is specified inside the instruction the location of the operand is implicit
asked Sep 16, 2014 in CO and Architecture Kathleen 7.8k views
...