1,003 views
1 votes
1 votes
I. Cache memory can be placed in between main memory and secondary storage

II. Cache memory can be used as secondary storage also.

Select correct statements

A. I only B. II only C. I and II D. None

1 Answer

1 votes
1 votes

Memory hierarchy is designed keeping in mind the requirements and limitation of data processing capability..For this purpose only memory hierarchy is designed..

Cache memory can be placed in 2 possible ways and hence of 2 types :

a) Physically addressed cache :

This is used to those contents in physical memory(main memory) which are frequently referred by CPU..But the addressing of those data is done in terms of physical addressing mechanism i.e. the same mechanism which we use to address physical memory

b) Virtual addressed cache :

This is used to map to logical(or virtual address) directly without the involvement of physical address.Hence no address translation is required for this type of cache..Hence it is placed before TLB..

So we have seen that in no way cache is placed between main memory and secondary storage doing which will lead to violation of memory hierarchy..

Again statement 2 is also wrong..The reason being that it will deny the purpose of cache..We call those storage devices as secondary devices which are not directly accessible by CPU..So if cache is used as secondary storage , so same will happen with cache as well.So it remains no longer directly accessible to CPU..Thus access time will increase drastically..

Hence option D) is true for the given question..

Related questions

0 votes
0 votes
1 answer
2
sh!va asked Nov 16, 2016
328 views
A network has B bandwidth and a sender is sending data of length L. If there are N intermediate routers from sender to destination, approximate delay will beA.2 NL/BB. NL...
0 votes
0 votes
1 answer
3
sh!va asked Jan 26, 2017
740 views
CIDR (Classless Inter Domain Routing)–1. It is used in class C Networks2. It is used in class B Networks3. It is used in class A Networks4. All of the above
0 votes
0 votes
2 answers
4
sh!va asked Feb 7, 2017
4,095 views
I. A heap is always nearly complete tree.II. Worst case complexity of heapify operation is O( log n)III. Worst case complexity of build heap operation is O( n log n)a. I ...