Practice Approximate Lru Implementation (19.1) - Approximate LRU Implementation

Practice: Approximate LRU Implementation

Lesson 19.1Approximate LRU Implementation

Practise this section

9 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
3 questions · about 2 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 a book's bookmark might signify usage.
Question 2.
What does FIFO stand for?
Show hintHide hint
Remember that this describes which page gets replaced first!
3Question 3.
What is the primary function of a reference bit?
- It signals page modification
- It states recent usage
- It allocates memory
Show hintHide hint
Think about what being 'accessed' means in context.
4Question 4.
True or False: The clock algorithm directly replaces pages with reference bits of 1.
- True
- False
Show hintHide hint
Recall the purpose of checking reference bits.
Question 5.
Consider a scenario with 5 pages and a page frame of 3. How would the pages be replaced using an approximate LRU approach given the access sequence: A, B, C, A, D, B, E, A, B, C, D, E?
Show hintHide hint
Map the access sequence while noting reference bits.
Question 6.
A system has two dirty pages and needs to replace one. If the pages are Page X (dirty) and Page Y (clean) with reference bits both set to 0, which page should be replaced and why?
Show hintHide hint
Consider the overhead of managing dirty pages.

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