Answer:
#include <stdio.h>
int main()
{
float afTest1[5] = {90, 30, 25, 45, 55};
for (int i = 0; i < 5; i++) {
printf("%f ", afTest1[i]);
}
return 0;
}
Explanation:
Initialize the elements of the array as 90, 30, 25, 45, 55
Create a for loop that iterates through the array
Inside the loop, print each element using printf function
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.
Closeup? I think I’m pretty sure but I don’t really know though
Depending on what kind of security measures are implemented, D would definitely be a contender. However, B is also something to take into consideration. I would answer D.<span />
Answer:
They're connected in different ways.
Explanation:
Speeds will vary by connection type. Ethernet (often called wired) is almost always faster than wireless.
