Computer organization mcqs replacement algorithm
Congratulations - you have completed Computer organization mcqs replacement algorithm.
You scored %%SCORE%% out of %%TOTAL%%.
Your performance has been rated as %%RATING%%
Your answers are highlighted below.
Question 1 [CLICK ON ANY COICE TO KNOW RIGHT ANSWER] |
The directly mapped cache no replacement algorithm is required.
True | |
False |
Question 1 Explanation:
The position of each block is pre-determined in the direct mapped cache, hence no need for replacement.
Question 2 [CLICK ON ANY COICE TO KNOW RIGHT ANSWER] |
The surroundings of the recently accessed block is called as .....
Neighborhood | |
Neighbour | |
Locality of reference | |
None of the mentioned |
Question 2 Explanation:
The locality of reference is a key factor in many of the replacement algorithms.
Question 3 [CLICK ON ANY COICE TO KNOW RIGHT ANSWER] |
In set associative and associative mapping there exists less flexibility.
True | |
False |
Question 3 Explanation:
The above two methods of mapping the decision of which block to be removed rests with the cache controller.
Question 4 [CLICK ON ANY COICE TO KNOW RIGHT ANSWER] |
The algorithm which replaces the block which has not been referenced for a while is called .....
LRU | |
ORF | |
Direct | |
Both LRU and ORF |
Question 4 Explanation:
LRU stands for Least Recently Used first.
Question 5 [CLICK ON ANY COICE TO KNOW RIGHT ANSWER] |
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.
Delay | |
Miss | |
Hit | |
Delayed hit |
Question 5 Explanation:
Miss usually occurs when the memory block required is not present in the cache.
Digital Education is a concept to renew the education system in the world. It is a program that endeavors to bridge the literacy slippage by delivering education through a digital platform to children and teachers. You can tell your friends regarding our intiative, click share button below.
There are 5 questions to complete.