This set of Computer Organization and Architecture Multiple Choice Questions & Answers (MCQs) focuses on “Replacement Algorithms”.
1. The directly mapped cache no replacement algorithm is required.
a) True
b) False
View Answer
Explanation: The position of each block is pre-determined in the direct mapped cache, hence no need for replacement.
2. The surroundings of the recently accessed block is called as ______
a) Neighborhood
b) Neighbour
c) Locality of reference
d) None of the mentioned
View Answer
Explanation: The locality of reference is a key factor in many of the replacement algorithms.
3. In set associative and associative mapping there exists less flexibility.
a) True
b) False
View Answer
Explanation: The above two methods of mapping the decision of which block to be removed rests with the cache controller.
4. The algorithm which replaces the block which has not been referenced for a while is called _____
a) LRU
b) ORF
c) Direct
d) Both LRU and ORF
View Answer
Explanation: LRU stands for Least Recently Used first.
5. 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.
a) Delay
b) Miss
c) Hit
d) Delayed hit
View Answer
Explanation: Miss usually occurs when the memory block required is not present in the cache.
6. 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
View Answer
Explanation: The LRU in case of the sequential blocks as to waste its one cycle just incrementing the counters.
7. The algorithm which removes the recently used page first is ________
a) LRU
b) MRU
c) OFM
d) None of the mentioned
View Answer
Explanation: In MRU it is assumed that the page accessed now is less likely to be accessed again.
8. The LRU can be improved by providing a little randomness in the access.
a) True
b) False
View Answer
Explanation: None.
9. 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) Hit
b) Miss
c) Delay
d) None of the mentioned
View Answer
Explanation: If the referenced block is present in the memory it is called as a hit.
10. The counter that keeps track of how many times a block is most likely used is _______
a) Count
b) Reference counter
c) Use counter
d) Probable counter
View Answer
Explanation: None.
Sanfoundry Global Education & Learning Series – Computer Organisation and Architecture.
- Practice Information Technology MCQs
- Check Computer Organization and Architecture Books
- Practice BCA MCQs
- Practice Computer Science MCQs
- Apply for Computer Science Internship
