Computer organization mcqs replacement algorithm

ALL PRINTABLE PDF BOOKS FREE DOWNLOAD <<CLICK HERE>>

ALL PRINTABLE PDF BOOKS FREE DOWNLOAD <<CLICK HERE>>

Computer organization mcqs replacement algorithm

Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
The directly mapped cache no replacement algorithm is required.
A
True
B
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 CHOICE TO KNOW THE RIGHT ANSWER]
The surroundings of the recently accessed block is called as .....
A
Neighborhood
B
Neighbour
C
Locality of reference
D
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 CHOICE TO KNOW THE RIGHT ANSWER]
In set associative and associative mapping there exists less flexibility.
A
True
B
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 CHOICE TO KNOW THE RIGHT ANSWER]
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
Question 4 Explanation: 
LRU stands for Least Recently Used first.
Question 5 [CLICK ON ANY CHOICE TO KNOW THE 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.
A
Delay
B
Miss
C
Hit
D
Delayed hit
Question 5 Explanation: 
Miss usually occurs when the memory block required is not present in the cache.
There are 5 questions to complete.

DOWNLOAD ALL SUBJECTS PDF <<CLICK HERE>>