Practice Page Replacement Based On Reference Bytes (19.2.3) - Approximate LRU Implementation

Practice: Page Replacement Based on Reference Bytes

Lesson 19.2.3Approximate 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 indicate?
Show hintHide hint
Think about what helps systems decide on page replacements.
Question 2.
What is a dirty page?
Show hintHide hint
Consider what happens to data in memory.
3Question 3.
What is the primary function of a reference bit in page replacement?
- Indicates page has been accessed
- Stores data
- Marks the end of a program
Show hintHide hint
It's a flag that reflects page activity.
4Question 4.
True or False: Increasing page frames always leads to fewer page faults.
- True
- False
Show hintHide hint
Consider counterexamples in memory management.
Question 5.
Given a memory with 4 frames, simulate page replacement using FIFO for the following page reference string: 7, 0, 1, 2, 0, 3, 0, 4. Count the page faults.
Show hintHide hint
Track the frames filled step by step as the numbers come.
Question 6.
Discuss how implementing the clock algorithm could change performance in a real-world scenario with frequent page accesses.
Show hintHide hint
Consider the overall overhead reduction in checking pages.

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