Practice Computer Organization And Architecture: A Pedagogical Aspect (18.1) - Page Replacement Algorithms

Practice: Computer Organization and Architecture: A Pedagogical Aspect

Lesson 18.1Page Replacement Algorithms

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 does TLB stand for?
Show hintHide hint
Think of it as a map for quick address translations.
Question 2.
What replacement algorithm replaces the oldest page?
Show hintHide hint
It uses the principle of queuing.
3Question 3.
What does TLB stand for?
- Translation Lookaside Buffer
- Temporary Load Buffer
- Translation Load Buffer
Show hintHide hint
Focus on what it does, not just the words.
4Question 4.
True or False: Belady’s anomaly occurs when adding more page frames reduces page faults.
- True
- False
Show hintHide hint
Consider the implications of managing page frames.
Question 5.
In a simulated environment, you have LRU, FIFO, and Optimal algorithms. Given a sequence of page accesses A, B, C, D, E, A, B, D, E, F, how would each algorithm replace pages assuming we have 3 page frames?
Show hintHide hint
Map out the access sequence and replace based on the strategy.
Question 6.
You are given Belady’s anomaly. Simulate increasing frame allocations for the access sequence: 1, 2, 3, 4, 2, 1, 5. Determine the page faults with frame limits of 3 and 4 and discuss your results.
Show hintHide hint
Monitor how frames affect your fault total.

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