{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

hw01sol - ECSE-2610 Computer Components and Operations...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
ECSE-2610 Computer Components and Operations Homework # 1 Solutions Due Wednesday, Sept. 6 in studio 1-8 are from the Wakerly textbook, 4th edition. 1) 2.3. (2 points each part. 12 points total.) Solution 2) 2.5, parts a, b, e, f. (2 points each part. 8 points total.) Solution 3) 2.6, parts c, f-h. (2 points each part. 8 points total.) Solution
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
4) 2.10 (include carries). (2 points each part. 8 points total.) Solution 0000 01010 1011 01001 5) 2.11 signed-magnitude and 2’s complement only. (1 point for each item. 12 points total.) Solution 6) 2.13. Solution Up to d errors can always be detected by a code with Hamming distance d + 1. If d + 1 errors are made, it is possible to turn one codeword into another, so that no errors are detected. 7) 2.34. (8 points) Solution
Background image of page 2
8) 2.46. (8 points) Solution 9) Consider the (4,7) Hamming code presented in class. Let the data bits, ( b 1 ,b 2 ,b 3 b 4 ) = (1,1,0,0). a) (8 points) Compute the codeword ( x 1 ,x 2 ,x 3 ,x 4 ,x 5 ,x 6 ,x 7 ) for this data string. Solution x 1 = b 1 b 2 b 4 = 1 ⊕ 1 ⊕ 0 = 0. x 2 = b 1 b 3 b 4 = 1 ⊕ 0 ⊕ 0 = 1. x 3 = b 1 = 1. x 4 = b 2 b 3 b 4 = 1
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Background image of page 4
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}