Practice Search Mechanism In Circular List (19.3.2) - Approximate LRU Implementation

Practice: Search Mechanism in Circular List

Lesson 19.3.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 does the reference bit indicate?
Show hintHide hint
Think about access tracking.
Question 2.
Describe FIFO in the context of page replacement.
Show hintHide hint
Consider how you might line up data in sequence.
3Question 3.
What is the purpose of a reference bit?
- To track if a page is dirty
- To indicate access to a page
- To count page faults
Show hintHide hint
Consider how the system keeps track of memory.
4Question 4.
Is the FIFO algorithm optimal in all situations?
- True
- False
Show hintHide hint
Think about when you'd want to keep a page.
Question 5.
A system uses the second chance algorithm for page replacement with pages A, B, C, D, and E. If A and C have their reference bits set, which one gets evicted when memory is full?
Show hintHide hint
Consider which pages have been given chances already.
Question 6.
If you have a page access pattern of A, B, C, D, A, B over a series of accesses with a maximum of 3 pages in memory, how many page faults occur with FIFO and sampled LRU?
Show hintHide hint
Think about the differences in how pages are tracked.

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