Which of the following are cache replacement algorithms. a. Thrashing
b. LILO
c. LRU
d. FIFO
e. Random
f. Double elimination

FIFO,LRU,Random are the cache replacement algorithms.

Explanation:

FIFO we use for cache replacement as the first enter the cache first is evicted without ant regard of how many times it was before accessed.

LRU (Least recently used ) it is a important cache replacement algorithm As it arranges the items in order of use and it will allow you to identify quickly which item hasn't been used for the longest amount of time.

Random is also used but it is used very less As it will select any of the data item from cache and replaces with the desire one And it will not keep track of history

answer; ///shut the compressor off.