Computer Organization and Architecture Multiple Choice Questions on “Mapping Functions”.
1. The memory blocks are mapped on to the cache with the help of ______
a) Hash functions
b) Vectors
c) Mapping functions
d) None of the mentioned
Answer: c
Clarification: The mapping functions are used to map the memory blocks on to their corresponding cache block.
2. During a write operation if the required block is not present in the cache then ______ occurs.
a) Write latency
b) Write hit
c) Write delay
d) Write miss
Answer: d
Clarification: This indicates that the operation has missed and it brings the required block into the cache.
3. In ________ protocol the information is directly written into the main memory.
a) Write through
b) Write back
c) Write first
d) None of the mentioned
Answer: a
Clarification: In case of the miss, then the data gets written directly in main memory.
4. The only draw back of using the early start protocol is _______
a) Time delay
b) Complexity of circuit
c) Latency
d) High miss rate
Answer: b
Clarification: In this protocol, the required block is read and directly sent to the processor.
5. The method of mapping the consecutive memory blocks to consecutive cache blocks is called ______
a) Set associative
b) Associative
c) Direct
d) Indirect
Answer: c
Clarification: This method is most simple to implement as it involves direct mapping of memory blocks.
6. While using the direct mapping technique, in a 16 bit system the higher order 5 bits are used for ________
a) Tag
b) Block
c) Word
d) Id
Answer: a
Clarification: The tag is used to identify the block mapped onto one particular cache block.
7. In direct mapping the presence of the block in memory is checked with the help of block field.
a) True
b) False
Answer: b
Clarification: The tag field is used to check the presence of a mem block.
8. In associative mapping, in a 16 bit system the tag field has ______ bits.
a) 12
b) 8
c) 9
d) 10
Answer: a
Clarification: The Tag field is used as an id for the different memory blocks mapped to the cache.
9. The associative mapping is costlier than direct mapping.
a) True
b) False
Answer: a
Clarification: In associative mapping, all the tags have to be searched to find the block.
10. The technique of searching for a block by going through all the tags is ______
a) Linear search
b) Binary search
c) Associative search
d) None of the mentioned
Answer: c
Clarification: None.
11. The set-associative map technique is a combination of the direct and associative technique.
a) True
b) False
Answer: a
Clarification: The combination of the efficiency of the associative method and the cheapness of the direct mapping, we get the set-associative mapping.
12. In set-associative technique, the blocks are grouped into ______ sets.
a) 4
b) 8
c) 12
d) 6
Answer: d
Clarification: The set-associative technique groups the blocks into different sets.
13. A control bit called _________ has to be provided to each block in set-associative.
a) Idol bit
b) Valid bit
c) Reference bit
d) All of the mentioned
Answer: b
Clarification: The valid bit is used to indicate that the block holds valid information.
14. The bit used to indicate whether the block was recently used or not is _______
a) Idol bit
b) Control bit
c) Reference bit
d) Dirty bit
Answer: d
Clarification: The dirty bit is used to show that the block was recently modified and for a replacement algorithm.
15. Data which is not up-to date is called as _______
a) Spoilt data
b) Stale data
c) Dirty data
d) None of the mentioned
Answer: b