Practice Extension With Dirty Bit (19.5.1) - Approximate LRU Implementation

Practice: Extension with Dirty Bit

Lesson 19.5.1Approximate LRU Implementation

Practise this section

10 questions

Flashcard drill
5 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 the state of the page.
Question 2.
What happens to the reference bits at regular time intervals?
Show hintHide hint
It has to do with tracking usage over time.
3Question 3.
What does a reference bit signify?
- It indicates if a page is dirty
- It shows if a page was accessed
- It points to next page
Show hintHide hint
Look for what the bit tracks regarding usage.
4Question 4.
T/F: A dirty page must be written back to the disk before replacement.
- True
- False
Show hintHide hint
Consider what it means for a page to be modified.
Question 5.
Given a sequence of page accesses (1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5), analyze this using both Approximate LRU and the Clock Algorithm with 3 page frames, detailing each replacement and outcome.
Show hintHide hint
Keep track of each page frame and note down hits and misses.
Question 6.
Explain how increasing the number of page frames can lead to Belady's anomaly using a practical example of two different frame setups and compare the resulting page faults.
Show hintHide hint
Consider what pages get replaced in your examples.

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