Which cache replacement algorithm removes the least recently used bloc — PYQDeck

PyQdeckBEU PYQ Archive Subjects

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 Google Ask AI

Similar questions

COMPUTER ORGANIZATION & ARCHITECTUREIn cache memory, FIFO and LRU are examples of: (i) Mapping techniques (ii) Addressing techniques (iii) Replacement algorithms (iv) Write policies20252m COMPUTER ORGANIZATION & ARCHITECTUREExplain different cache replacement algorithms used in memory management.20247m 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)20232m OPERATING 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-core NextWhich technique is used to handle data hazards in pipelining? a) Increasing memory size b) Instruction scheduling c) Parallel processing d) Increasing clock speed