PyQdeck LogoPyQdeckSubjectsSyllabusBlog
Back to the 2024 paper

Module 4: Memory Organization

20242m

Which cache replacement algorithm removes the least recently used block.
(i) FIFO
(ii) LRU
(iii) Random Replacement

Search GoogleAsk AI
Worked SolutionAI Assisted

Answer: (ii) LRU

Explanation:

  • LRU (Least Recently Used): Evicts block that has not been referenced for longest time - exploits temporal locality; needs timestamp/counter/stack.
  • FIFO: Evicts oldest inserted block regardless of recent use.
  • Random Replacement: Random victim - simple hardware.

LRU gives best hit rate among three but most complex to implement.

Similar questions

OPERATING SYSTEMWhich of the following page replacement algorithms suffers from Belady's anomaly? (i) Optimal replacement (ii) LRU (iii) FIFO (iv) Both (a) and (c)20232mOperating SystemWhich page replacement algorithm replaces the page that will not be used for the longest period in the future? (i) Optimal (ii) Second Chance (iii) FIFO (iv) NRU20252mOperating SystemIn which of the following page replacement policy Belady's anomaly occurs? (i) FIFO (ii) LRU (iii) LFU (iv) NRU20222mOPERATING SYSTEMConsider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. Compare the page faults occur for the following replacement algorithms using 3 frames? Assume, initially all the frames are empty. (i) LRU replacement (ii) FIFO Replacement202414m
PreviousWhich of the following is *NOT* a type of parallel processor architecture? a) SIMD b) MIMD c) SISO d) Multi-coreNextWhich technique is used to handle data hazards in pipelining? a) Increasing memory size b) Instruction scheduling c) Parallel processing d) Increasing clock speed
Budget AppAndroid App

Pocketly on Android

Log daily food, travel, and hostel expenses instantly. Set monthly spending limits and see where your money goes without complex spreadsheets.

Install Pocketly