CS-2002 Question Paper With Solutions

Q. 23 The optimal page replacement algorithm will select the page that

(A) Has not been used for the longest time in the past.

(B) Will not be used for the longest time in the future.

(C) Has been used least number of times.

(D) Has been used most number of times.

Answer: (B)

Explanation:

CS-2002 Question Paper With Solutions

Learn More:   Gate ME-2009 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here