Practice Cache Replacement Policies (6.3.3) - Memory

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 is the main objective of cache replacement policies?
Show hintHide hint
Think about how limited storage impacts performance.
Question 2.
What does FIFO stand for in cache management?
Show hintHide hint
It's based on a queue system.
3Question 3.
What policy does LRU use to decide which cache entry to remove?
- Oldest data
- Least recently accessed data
- Randomly chosen
Show hintHide hint
Remember what LRU stands for.
4Question 4.
True or False: FIFO replaces the most recently accessed data first.
- True
- False
Show hintHide hint
Think about the order in which data arrives.
Question 5.
Given a series of data requests, demonstrate how LRU would operate by tracking which items are kept or removed. What are the outcomes compared to FIFO?
Show hintHide hint
Create a list or table for tracking data entries and their access order.
Question 6.
Design a hybrid cache policy that incorporates aspects of LRU and Random Replacement. Explain its potential advantages.
Show hintHide hint
Consider scenarios where access patterns may vary unexpectedly.

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