5.2.1-5.2.2*****

1. (60 points) 5.2.1-5.2.1 Assume memory addresses are 8 bits and all ad- dresses are word addresses. You can use a calculator to convert decimal values to binary For 5.2.2, assume cache block boundaries are aligned with even memory addresses. This means that a word at an even address will go into word 0 in a block and a word at an odd address will go into word 1 in the block. This further implies, that when a request is made for a word at an odd address, the block that is fetched into the cache is the one that contains the preceding word and the requested word. For example, if the request is made for word at location 17 then the words at locations 16 and 17 will be fetched (and not 17 and 18) Please present the answer to these questions in table format. For 5.2.1 create a table with following headings Decimal Address Binary Address Tag Index Hit/Miss For 5.2.2 another column should be added to report the block offset values For both tables the number of rows should be 12