Given a $32-$bit system with a $4-$way set associative cache, answer the following questions.

$1.$ How many words are stored in each column of data?

$2.$ How many words can you store in the cache? Answer A$-$D

A$.256$

B$.512$

C$.1024$

D$.0$

$3.$ If you increased the number of rows to $512,$ where would the offset division line move? Answer A$-$C

A$.$ It would move left

B$.$ It would move right

C$.$ It would not change

$4.$ If you increased the number of rows to $512,$ where would the index division line move? Answer A$-$C

A$.$ It would move left

B$.$ It would move right

C$.$ It would not change

$5.$ This $256-$row cache is an example of an n$-$way set associative design, what is the $512-$row design? Answer A$-$C

A$.$ Fully Associative

B$.$ Direct Mapped

C$.$ N$-$way set associative

$6.$ How many words can you store in the cache now? Answer A$-$D

A$.256$

B$.512$

C$.1024$

D$.0$

$7.$ If you increased the number of rows to $1024$ and the cache size overall did not change, what would the division of bits look like now

How many bits for the tag?

How many bits for the index?

How many bits for the offset?

$8.$ This $256-$row cache is an example of an n$-$way set associative design, what is the $1024-$row design? Answer A$-$C

A$.$ Fully Associative

B$.$ Direct Mapped

C$.$ N$-$way set associative

$9.$ How many words can you store in the cache now? Answer A$-$D

A$.256$

B$.512$

C$.1024$

D$.0$

$10.$ What would the division of bits look like if we moved to a fully associative cache?

How many bits for the tag?

How many bits for the index?

How many bits for the offset?

$11.$ These rows help narrow down your search to see if your item is stored in cache, true or false?