The LRU provides very bad performance when it comes to _________ – McqOptions

MCQOPTIONS

1.	The LRU provides very bad performance when it comes to _________
A.	Blocks being accessed is sequential
B.	When the blocks are randomised
C.	When the consecutive blocks accessed are in the extremes
D.	None of the mentioned
Answer» B. When the blocks are randomised

Discussion

No Comment Found

Related MCQs

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_______?$#
The counter that keeps track of how many times a block is most likely used is _______$
The LRU can be improved by providing a little randomness in the access?
The algorithm which removes the recently used page first is ________
The LRU provides very bad performance when it comes to _________
In associative mapping during LRU, the counter of the new block is set to ‚Äö√Ñ√∂‚àö√ë‚àö‚â§0‚Äö√Ñ√∂‚àö√ë‚àö¬• and all the others are incremented by one when _____ occurs.$
The algorithm which replaces the block which has not been referenced for a while is called _____
In set associative and associative mapping there exists less flexibility.
The surroundings of the recently accessed block is called as ______
The directly mapped cache no replacement algorithm is required.