Practice Setting Reference Bits To 0 (19.1.2) - Approximate LRU Implementation

Practice: Setting Reference Bits to 0

Lesson 19.1.2Approximate 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 happens to a reference bit when a page is accessed?
Show hintHide hint
Think about tracking access frequency.
Question 2.
Why do we reset reference bits at the beginning of a new interval?
Show hintHide hint
Consider how this aids in replacement decisions.
3Question 3.
What happens to the reference bit when a page is accessed?
- It is set to 0
- It is set to 1
- It is deleted
Show hintHide hint
Think about what we need to track when a page is used.
4Question 4.
True or False: A dirty page can be replaced without writing it to disk first.
- True
- False
Show hintHide hint
Remember the consequences of modifying a page.
Question 5.
Consider a system with 5 pages and a time interval where each page gets accessed. If the pages are subsequently accessed in this order: A, B, C, D, A, B, C, D, E, determine how many pages will be replaced and in what order according to both FIFO and the second-chance algorithm.
Show hintHide hint
Map out the access pattern and evaluate the queues created by each algorithm.
Question 6.
If a dirty page is replaced, what are the conditions and penalties involved? Illustrate with an example.
Show hintHide hint
Consider the workload on memory management based on page state.

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