CA & CO Chapter 5 practice problem
Suppose an 8-bit data word stored in memory is 11000010. Using the Hamming algorithm, determine what check its would be stored in memory with the data word. Show how you got your answer. 8-bit data에는 4-bit의 check bits가 필요하다. Check bits들의 even parity를 확인하면 된다. Check bits들은 2진수 표현에서 각 자리가 1이고 나머지가 0인 위치에 존재한다. 예) C -> 0001, 0010, 0100, 1000 -> 1, 2, 4, 8 -> C1, C2, C4, C8 각 C들의 비트는 해당 자릿수가 1인 data..
2020. 4. 26.
CA & CO Chapter 4 practice problem
for the hexadecimal main memory addresses 111111, 666666, BBBBBB, show the following information, in hexadecimal format: Tag, Line, and Word values for a direct-mapped cache, using the format of Figure 4.10 Tag and Word values for an associative cache, using the format of Figure 4.12 Tag, Set, and Word values for a two-way set-associative caches, using the format of Figure 4.15 111111h = 0001 00..
2020. 4. 21.
