331.
The LRU algorithm
Answer: C
Correct answer: pages out pages that have been least used recently
LRU - least recently used - evicts the page that has gone longest without being referenced, on the assumption that a page untouched for a long time is the least likely to be needed next. It approximates the optimal policy well, but tracking the order of use exactly is expensive, so it is usually approximated with reference bits.
Please log in or register to report this question.