Practice Reference Bit Strategy (17.4.1) - FIFO Page Replacement - Computer Organisation and Architecture

Practise this section

10 questions

Flashcard drill
5 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 FIFO stand for?
Show hintHide hint
Think about the order in which items are processed.
Question 2.
Name one disadvantage of the FIFO page replacement strategy.
Show hintHide hint
Consider if old pages are still needed.
3Question 3.
What does FIFO stand for?
- First-In-First-Out
- First-Input-First-Output
- Fast-Input-Fast-Output
Show hintHide hint
Think about queue management.
4Question 4.
True or False: LRU page replacement considers past access patterns.
- True
- False
Show hintHide hint
It remembers the recent history of page accesses.
Question 5.
Consider a system with 4 memory frames. Given the reference string 4, 3, 2, 1, 4, 3, 2, 5, using FIFO, how many page faults occur?
Show hintHide hint
Visualize how pages would fill up and be replaced.
Question 6.
Given a string 1, 5, 2, 1, 3, 2, 5, 1 using an optimal page replacement strategy and 3 frames, how many page faults?
Show hintHide hint
Try to replace the page that will not be needed in the future.

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