The algorithm which replaces the block which has not been referenced for a while is called            

Related MCQs

• In direct mapping the presence of the block in memory is checked with the help of block field.
• In LRU, the referenced blocks counter is set to’0′ and that of the previous blocks are incremented by one and others remain same, in the case of
• A control bit called                     has to be provided to each block in set- associative.
• The bit used to store whether the page has been modified or not is called as                 
• The block transfer capability of the DRAM is called                   
• The general purpose registers are combined into a block called as               
• During a write operation if the required block is not present in the cache then               occurs.
• The bit used to indicate whether the block was recently used or not is
•            directive is used to specify and assign the memory required for the block of code.
• The technique of searching for a block by going through all the tags is