Practice Calculating Page Faults (19.6.2) - Approximate LRU Implementation

Practice: Calculating Page Faults

Lesson 19.6.2Approximate 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 happens during a page fault?
Show hintHide hint
Think about the actions taken by the operating system.
Question 2.
Define a reference bit.
Show hintHide hint
What does this bit help determine?
3Question 3.
What algorithm uses reference bits to track page access?
- FIFO
- Approximate LRU
- Optimal
Show hintHide hint
Remember the algorithm specifically aimed at reducing hardware cost.
4Question 4.
True or False: The Clock Algorithm allows for pages to have a second chance if their reference bit is set to 1.
- True
- False
Show hintHide hint
Think about how it manages page referencing.
Question 5.
Given a series of memory access sequences, demonstrate how the Clock Algorithm would resolve page faults with 3 frames. Show each step of the selection process.
Show hintHide hint
Start from the pointer's last position and iterate around the structure.
Question 6.
Simulate a scenario with both the Sampled LRU and Approximate LRU algorithms. Use an access sequence and compare the number of page faults for each method.
Show hintHide hint
Remember to factor in the tracking nuances of each algorithm.

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