UTK Notes

Home / CS230 / Practices / Cache Practice

• Cache Practice
  • Question 1
  • Question 2
  • Question 3
  • Question 4
  • Question 5
  • Question 6
  • Question 7
  • Question 8
  • Question 9
  • Question 10
  • Question 11
  • Question 12
  • Question 13
  • Question 14
  • Question 15

Cache Practice

Question 1

Which of the following eviction policies requires the cache to store the number of accesses for the given memory address?

LFU

Question 2

A cache hit is when a value is in cache and hence no penalty is suffered.

Question 3

For a 32-bit memory address, a cache with a tag size of 19 bits and a set size of 4 bits would store how many bytes of data per block?

512

Question 4

The concept of spatial locality means that the chances of using a value around the value I just used is likely.

Question 5

The write-back write policy may make it difficult to maintain synchronization mong all operating cores.

Question 6

A conflict miss can be mitigated by increasing the associativity.

Question 7

A compulsory miss can be mitigated by increasing the block size.

Question 8

Which of the following eviction policies requires the cache to store the latest access time for the given memory address?

LRU

Question 9

A value not in cache, thus incurring a time penalty, is called a cache miss.

Question 10

The chance that when a value is used it will be used again in the near future is called temporal locality.

Question 11

The write through cache policy writes to the given cache and the backing storage.

Question 12

Split cache refers to cache that divides instructions and data into two pieces of cache memory.

Question 13

Fully-associative cache is said to have 1 set(s) and many way(s).

Question 14

In direct-mapped cache, the tag is the part of the memory address that CAN NOT be determined by the set or byte offset.

Question 15

Dividing a set into multiple ways increases the associativity of the cache.