Discussion
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.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development