Question: n - - - - - - - - - - - - - - - - - - - - - - - -

n ----------------------------, replace that block in (the set)/
the cache that has experienced the fewest references
*
LFU replacement algorithm
FIFO replacement algorithm
LRU replacement algorithm

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!