Check the Right Answer of the following :

1. The small extremely fast, RAM’s are called as _______
a. Cache
b. Heaps
c. Accumulators
d. Stacks
2. The algorithm which replaces the block which has not beenreferenced
for a while is called _____
a. LRU
b. MFU
c. FIFO
d. Both LRU and MFU
3. The surroundings of the recently accessed block is called as______
a. Neighborhood
b. Neighbor
c. Locality of reference
d. None of the mentioned
4. The reason for the implementation of the cache memory is________
a. To increase the internal memory of the system
b. The difference in speeds between the CPU and memory
c. To reduce the memory access and cycle time
d. All of the mentioned
5. The algorithm to remove and place new contents into the cache iscalled _______
a. Replacement algorithm
b. Renewal algorithm
c. Updation
d. None of the mentioned