Practice Fifo Strategy For Replacement (19.1.4) - Approximate LRU Implementation

Practice: FIFO Strategy for Replacement

Lesson 19.1.4Approximate LRU Implementation

Practise this section

9 questions

Flashcard drill
3 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 does FIFO stand for?
Show hintHide hint
Think of a line at a store.
Question 2.
How does a reference bit help in page replacement?
Show hintHide hint
Consider how we keep track of what we have done.
3Question 3.
What is the primary purpose of the FIFO page replacement strategy?
- To evict the most recently used page
- To evict the oldest page
- To randomize page replacement
Show hintHide hint
Think about which page would leave the queue first.
4Question 4.
True or False: The clock algorithm allows access to a page that is currently being modified.
- True
- False
Show hintHide hint
Consider what happens to modified data.
Question 5.
Consider a system using FIFO replacement with a memory size capable of holding four pages. Given an access sequence of 1, 2, 3, 4, 2, 1, 5, 1, and 2, how many page faults will occur?
Show hintHide hint
Track the pages in memory and how they change with each access.
Question 6.
In a sampled LRU scenario, if the reference byte for a particular page reflects [0, 0, 1, 1, 0, 1] over 6 intervals, determine the numerical value of the reference byte and its implication for page replacement.
Show hintHide hint
Convert the binary to decimal to assess recent usage.

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