Vidyalelo
Data Structure · Q100

Miscellaneous on Data Structures

Programming · Data Structure · question 100

Q100

In a optimal page replacement algorithm, when a page is to be replaced, which of the following pages is chosen?

A.
Oldest page
B.
Newest page
C.
Frequently occurred page in the future
D.
Not frequently occurred page in the future
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board