{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

c05_ps03_sol - C5 Solutions 1 Convert the following base 10...

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

View Full Document Right Arrow Icon
C5 Solutions 1. Convert the following base 10 numbers into 8-bit 2’s complement notation 0, -1, -12 To Compute 0 0 = 00000000 To Compute –1 Step 1. Convert 1 to binary 00000001 Step 2. Flip the bits 11111110 Step3. Add 1 11111111 Therefore –1 = 11111111 To Compute –12 Step 1. Convert 12 to binary 00001100 Step 2. Flip the bits 11110011 Step3. Add 1 11110100 Therefore –12 = 11110100
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
2. Perform each of the following additions assuming that the bit strings represent values in 2’s complement notation. Identify the cases in which the answer is incorrect because of overflow. 1111 + 1111 11110 Answer = 11110 Overflow = 0 Answer is correct 01111 + 10001 100000 Answer = 00000 Overflow = 1 Answer is incorrect 01110 + 01010 11000 Answer = 11000 Overflow = 0 Answer is correct
Background image of page 2
3. Write an algorithm to convert a negative decimal number into a binary number in 2’s complement form. Assume that the number ranges from +127 to -128 1. If the number is less than 0 a. Multiply by –1 b. Flip the bits by ‘number XOR 0xff’ c. Add 1 to the result 2. Convert the number into binary
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
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}