Cache Performance Optimizations Notes Questions with Answers PDF Download – Test 143

MCQ 711: When the computer processor does not get a data item, it requires in the cache, then the problem is known as:

1. cache miss
2. cache hit
3. file caches
4. name cache

MCQ 712: The unit used to allocate dynamic objects which do not adhere to the stack discipline is:

1. queue
2. stack
3. heap
4. banks

MCQ 713: A mapping that works well for spreading the block addresses sequentially all across the banks, are called:

1. sequential interleaving
2. spatial interleaving
3. sequential interaction
4. sequential interchange

MCQ 714: The amount of time required to read a block of data from a disk into memory is composed of seek time, rotational latency, and transfer time. Rotational latency refers to the time its takes for the:

1. platter to make a full rotation
2. read-write head to move into position over the appropriate track
3. platter to rotate the correct sector under the head
4. none of above

MCQ 715: Any network topology that provides this bisection bandwidth is said to have:

1. half bisection bandwidth
2. full bisection bandwidth
3. unisection bandwidth
4. torus topology