Answer:
D) ["Kathy Bones", "Jill Brewer", "Joe Schnook", "Tom Smith"]
Explanation:
The context of the problem explains a computer program that sorts names in "ascending order" (A to Z) since the ASCII table has capital A start a lower number and it increases from there to capital Z.
Notice how the attached file, which is a portion of the ASCII table, shows that letters after A are also higher in decimal value than the previous letter.
With this in mind, we know that all this program does is sort by last name alphabetical order. From there, just sort the given names using that same criteria, last name alphabetical order, and the correct answer is determined.
<em>Please put "Brainliest" on my answer if it helped you out!</em>
<em>If you want to learn more about this subject, you can search:</em>
<em>- ASCII Table</em>
<em>- Lists in Programming</em>
<em>- Sorting Procedures</em>
Answer:
Routers control traffic between networks while switches control traffic within a network
Explanation:
Router and switches both are used to control the traffic. In local area network, different computer are connected with each other with in the organization or network. Switch is used to connect all the computers or devices in the local area network (LAN). The switch is responsible for connecting all the computers in the LAN and controlling the traffic within the LAN network.
On the other hand, Wide Area Network (WAN) is consist of multiple number of Local Area Networks (LANs). To connect all the LAN router is used. Router is responsible for connecting all the networks in the WAN and also responsible for controlling traffic between different networks.
Click options in the tools menu and select track changers
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.
