Answer:
1. 2588672 bits
2. 4308992 bits
3. The larger the data size of the cache, the larger the area of memory you will need to "search" making the access time and performance slower than the a cache with a smaller data size.
Explanation:
1. Number of bits in the first cache
Using the formula: (2^index bits) * (valid bits + tag bits + (data bits * 2^offset bits))
total bits = 2^15 (1+14+(32*2^1)) = 2588672 bits
2. Number of bits in the Cache with 16 word blocks
Using the formula: (2^index bits) * (valid bits + tag bits + (data bits * 2^offset bits))
total bits = 2^13(1 +13+(32*2^4)) = 4308992 bits
3. Caches are used to help achieve good performance with slow main memories. However, due to architectural limitations of cache, larger data size of cache are not as effective than the smaller data size. A larger cache will have a lower miss rate and a higher delay. The larger the data size of the cache, the larger the area of memory you will need to "search" making the access time and performance slower than the a cache with a smaller data size.
I believe the answer is <u>Using sound effects between slides.</u>
Using sound effects between slides can cause for a distraction, and if you are in college, your professor may not score your presentation as well as if it were made without sound effects. Hope this helps!
<span>each entry in an array of strings is actually a pointer to the first character of a string
Each indice in an array of strings (which are actually each actually an array of char) is actually a pointer to the first (0th) char of a string.
</span>
Answer:
the output processed data
Try using socrative to answer your question it’s really good
