Practice Reference Bit Mechanism (19.1.1) - Approximate LRU Implementation

Practice: Reference Bit Mechanism

Lesson 19.1.1Approximate 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 does a reference bit signify?
Show hintHide hint
Think about tracking usage.
Question 2.
What happens to reference bits at the end of a time interval?
Show hintHide hint
Consider periodic updates.
3Question 3.
What does the reference bit indicate?
- Whether a page is in memory
- Whether a page has been accessed
- The write state of a page
Show hintHide hint
It's about tracking access rather than physical location.
4Question 4.
True or False: A dirty page needs to be written back to the disk before it can be replaced.
- True
- False
Show hintHide hint
Consider what happens when changes are made.
Question 5.
Consider a system with a page size of 4KB. If 10 pages are accessed in sequential order across three frames, compute the total number of page faults using FIFO and Clock algorithms. Show your results and comparisons.
Show hintHide hint
Keep track of which pages are currently in memory.
Question 6.
Create a scenario illustrating Belady's Anomaly with a specific reference string and demonstrate the difference in page fault rates between 3 and 4 page frames.
Show hintHide hint
Document which frames are replaced in each algorithm.

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