Register

GATE CSE 2002 | Question: 1.23

8,252 views
21 votes
21 votes

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
User Avatar

1 Answer

Best answer
40 votes
40 votes

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
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

31 votes
31 votes
5 answers
1
Kathleen asked Sep 15, 2014
18,287 views
GATE CSE 2002 | Question: 1.22
Which of the following scheduling algorithms is non-preemptive? Round Robin First-In First-Out Multilevel Queue Scheduling Multilevel Queue Scheduling with Feedback
Which of the following scheduling algorithms is non-preemptive?Round RobinFirst-In First-OutMultilevel Queue SchedulingMultilevel Queue Scheduling with Feedback
User Avatar
28 votes
28 votes
4 answers
2
Kathleen asked Sep 15, 2014
6,886 views
GATE CSE 2002 | Question: 2.20
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
Dynamic linking can cause security concerns becauseSecurity is dynamicThe path for searching dynamic libraries is not known till runtimeLinking is insecureCryptographic p...
User Avatar
39 votes
39 votes
8 answers
3
Kathleen asked Sep 15, 2014
18,714 views
GATE CSE 2002 | Question: 1.25, ISRO2008-30, ISRO2016-6
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}$
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}$
User Avatar
32 votes
32 votes
5 answers
4
Kathleen asked Sep 15, 2014
13,810 views
GATE CSE 2002 | Question: 1.24
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
In the absolute addressing mode:the operand is inside the instructionthe address of the operand in inside the instructionthe register containing the address of the operan...
User Avatar
Link Copied!