# Description: sh3ar2 JUBAIL UNIVERSITY COLLEGE DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SEMESTER 382 CS 308 COMPUTER ARCHITECTURE ASSIGNMENT -1 (7%) 1. For the Hamming code shown in Figure 5.10, show what happens when a check bit of position 2 rather than a data bit is in error? 2. Suppose an 8-bit data word stored in memory is 00010011. Using the Hamming algorithm, determine what check bits would be stored in memory with the data word. Show how you got your answer. 3. For the 8-bit word 00100001, the check bits stored with it would be 1001. Suppose when the word is read from memory, the check bits are calculated to be 0101.What is the data word that was read from memory? 4. How many check bits are needed if the Hamming error correction code is used to detect single bit errors in a 4096-bit data word? 5. Consider a machine with a byte addressable main memory of 216 bytes and block size of 8 bytes. Assume that a direct mapped cache consisting of 32 lines is used with this machine. a. How is a 16-bit memory address divided into tag, line number, and byte number? b. Into what line would bytes with each of the following addresses be stored? 0001 0001 0001 1011 1100 0011 0011 0100 1101 0000 0001 1101 1010 0 1010 1010 6. Suppose that we have a 7-bit word DRAM. Assume that you store the 7-bit input word: 0111001. a. What is the minimum number of ‘k’ bits necessary for the Hamming single error- correcting (SEC)? Suppose that when you read the data, the bit 1 of the input value (let bit 1 the least significant bit), change from 1 to 0 (without change of the parity bits). b. Show the whole procedure for the check bit calculation 7. Define Seek Time, Rotational Delay and Transfer Time. Instructions: – Date of Submission is 29/3/2018. Submit the hardcopy on time, late submissions will face penalties.

JUBAIL UNIVERSITY COLLEGE

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SEMESTER 382

CS 308 COMPUTER ARCHITECTURE

ASSIGNMENT -1 (7%)

1. For the Hamming code shown in Figure 5.10, show what happens when a check bit of position 2 rather than a data bit is in error?

2. Suppose an 8-bit data word stored in memory is 00010011. Using the Hamming algorithm, determine what check bits would be stored in memory with the data word. Show how you got your answer.

3. For the 8-bit word 00100001, the check bits stored with it would be 1001. Suppose when the word is read from memory, the check bits are calculated to be 0101.What is the data word that was read from memory?

4. How many check bits are needed if the Hamming error correction code is used to detect single bit errors in a 4096-bit data word?

5. Consider a machine with a byte addressable main memory of 216 bytes and block size of 8 bytes. Assume that a direct mapped cache consisting of 32 lines is used with this machine.

a. How is a 16-bit memory address divided into tag, line number, and byte number?

b. Into what line would bytes with each of the following addresses be stored?

0001 0001 0001 1011

1100 0011 0011 0100

1101 0000 0001 1101

1010 0 1010 1010

6. Suppose that we have a 7-bit word DRAM. Assume that you store the 7-bit input

word: 0111001.

a. What is the minimum number of ‘k’ bits necessary for the Hamming single error-

correcting (SEC)?

Suppose that when you read the data, the bit 1 of the input value (let bit 1 the

least significant bit), change from 1 to 0 (without change of the parity bits).

b. Show the whole procedure for the check bit calculation

7. Define Seek Time, Rotational Delay and Transfer Time.

Instructions: – Date of Submission is 29/3/2018. Submit the hardcopy on time, late submissions will face penalties.