(26)
Answer: Hard disk
Explanation:
Hard disk supports speedy retrieval of data compared to optical disk, magnetic disk and USB flash drive.
(27)
Given,
Memory address has 8 bits.
Number of cache blocks = 8.
Therefore, number of bits required in the block filed = log2 n = log2 8 = 3.
Block size = 4 Bytes.
Therefore, number of bits required in the block offset required = log2 n = log2 4 = 2.
Tag field requires = 8 - 3 - 2 = 3.
Therefore,
Tag: 3 bits
Block: 3 bits
Offset: 2 bits
Given Address is : 0x1F = 0001 1111
Tag (3 bits) | Block (3 bits) | Offset (2 bits) |
000 | 111 | 111 |
Given memory address map to cache block 1112 = 710 = 0x0716
Therefore, given memory address maps to cache block 7.
both ques pls Question 26 1 pts Information can be retrieved fastest from: USB flash drive....
Question 29 7 pts Suppose we have a byte-addressable computer with a cache that holds 8 blocks of 4 bytes each. Assuming that each memory address has 8 bits, to which cache block would the hexadecimal address Ox1F map if the computer uses direct mapping?
please answer $5 UXIF map in the computer uses direct mapping Question 18 5 pts Suppose we have a byte-addressable computer using 2-way set associative mapping with 16-bit main memory addresses and 32 blocks of cache. Suppose also that each block contains 8 bytes. The size of the block offset field is bits, the bits. size of the set field is bits, and the size of the tag field is 5 pts Question 19 Suppose we have a byte-addressable computer...
29 pls clesr ans the average access time for the processor to access an item? 29ns Question 29 7 pts Consider a byte-addressable computer with 24-bit addresses, a cache capable of storing a total of 64K bytes of data, and blocks of 32 bytes. If the computer uses direct mapping, the format of the memory address is as follows: bits for the tag field, bits for the cache block number, and bits for the block offset. Question 30 7 pts...
pls both 31 Question 31 10 pts Suppose we have a byte-addressable computer using 4-way set associative mapping with 24-bit main memory addresses and 64 blocks of cache. Suppose also that a block contains 32 bytes. The size of the block offset field is bits, the size of the set field is bits, and the size of the tag field is bits. Question 32 1 pts is the oldest and most cost-effective of all mass-storage devices. Magnetic tape Compact dick...
Question 28 7 pts Consider a byte-addressable computer with 24-bit addresses, a cache capable of storing a total of 64K bytes of data, and blocks of 32 bytes. If the computer uses direct mapping, the format of the memory address is as follows: bits for the tag field, bits for the cache block number, and bits for the block offset.