Practice Sampled Lru Implementation (19.2) - Approximate LRU Implementation

Practise this section

10 questions

Flashcard drill
2 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
Consider what signals access or usage of a page.
Question 2.
How often are reference bits reset?
Show hintHide hint
Think about the need for evaluating page usage patterns periodically.
3Question 3.
What does a reference bit indicate?
- Accessed recently
- Never accessed
- Always accessed
Show hintHide hint
Think about what happens when a page is accessed.
4Question 4.
The clock algorithm assumes which structure for pages?
- Circular Linked List
- Stack
- Array
Show hintHide hint
Consider how this data structure helps in performing replacements.
Question 5.
Consider a scenario with 5 pages and a time interval of 3. Describe the page replacement sequence when pages A, B, C, D, and E are accessed in that order.
Show hintHide hint
Simulate page accesses and keep updating the reference bits.
Question 6.
Debate the efficiency of sampled LRU against fully implemented LRU. Provide pros and cons.
Show hintHide hint
Consider real-world applications and constraints.

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