adplus-dvertising
frame-decoration

Question

If a block can be placed at every location in the cache, this cache is said to be

a.

Indirectly mapped

b.

Directly mapped

c.

Fully associative

d.

Partially associative

Answer: (c).Fully associative

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. If a block can be placed at every location in the cache, this cache is said to be

Similar Questions

Discover Related MCQs

Q. For recording, was the block written, the Opteron keeps

Q. The information when is written in the cache, both to the block in the cache and the block present in the lower-level memory, refers to

Q. Average access time of memory for having memory-hierarchy performance is given as

Q. As segment or a page is normally used for block, page-fault and the address-fault is used for

Q. The block frame address are divided into the

Q. The increase in the width of the cache address tag, can be done with the

Q. The victim buffer's performance and the operation is almost similar to

Q. Assume that the hit-time is single clock cycle, independent of size of block, and then 16-byte block in a 4 KB cache will be having access-time of

Q. The virtual memory producing the virtual-addresses, are translated by

Q. The most obvious architectural parameter is the

Q. The time of CPU can be modeled as

Q. The processor protection structure expand memory access protection from two levels to many, the added ones are

Q. The virtually indexer's limitation, saying that a cache which is direct-mapped can have a size no bigger than the

Q. IA-32 allows the operating system to maintain the protection level of the called

Q. Per memory reference, the miss-rate can be turned into the per instruction misses rate by

Q. The field that is not found in paged systems, which establishes theupper bound of valid offsets for segments is called

Q. A common optimization for reducing write stalls is a

Q. Address translation cache is referred to as a

Q. Cutting of physical-memory into the form of blocks and allocating them to different processes, the stated technique is known as

Q. If the processor is not willing in the cycle for retiring the maximum number of instructions; it is said to be