Practice Reference Byte Mechanism (19.2.1) - Approximate LRU Implementation

Practise this section

10 questions

Flashcard drill
4 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
4 questions · about 3 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is a reference bit?
Show hintHide hint
Think about how we track usage of pages.
Question 2.
Explain FIFO in page replacement.
Show hintHide hint
This method prioritizes age, not usage.
3Question 3.
What does the reference bit indicate?
- Accessed recently
- Not accessed
- Uncertain
Show hintHide hint
How does the operating system keep track of active memory usage?
4Question 4.
True or False: The FIFO page replacement strategy is the most efficient method.
- True
- False
Show hintHide hint
Think about the principles of page replacement.
Question 5.
Design a scenario that demonstrates Belady's anomaly with specific memory access patterns.
Show hintHide hint
Use a simple sequence with predictable page accesses.
Question 6.
Critically analyze the performance differences between the reference byte mechanism and direct LRU implementations. What are the key trade-offs?
Show hintHide hint
Consider the hardware limitations against performance optimization.

6 more questions in this section. Enroll free to practise them all.