Q1038
Which of the following is a characteristic of random page replacement algorithm?
A.
It replaces the page that has been present in the main memory for the longest
B.
It uses a queue data structure for implementation
C.
It eliminates the overhead cost of tracking page reference
AnswerD.
It cannot be implemented
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board