

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Instructions for performing binary addition and subtraction with unsigned and signed 4-bit numbers using two's complement. It includes examples of addition and subtraction, as well as a table for signed overflow and a problem to apply booth's algorithm for multiplication.
Typology: Exercises
1 / 2
This page cannot be seen from the preview
Don't miss anything!


Perform the following additions: e) for unsigned numbers: 01002 (4 10 ) 10012 (9 10 )
f) for signed numbers: 01002 (4 10 ) 01002 (4 10 ) 11002 (-4 10 ) (two’s compliment) + 01102 (6 10 ) + 10102 (-6 10 ) + 10102 (-6 10 )
These two rows cannot cause signed overflow in addition
Operand 1 Operand 2
Wrong Sign of Result (indicates overflow)
Expected Sign of Result
Sign of Operands for addition
b) For 4-bit signed numbers , when do we have overflow and get the wrong result during addition? (Hint: think about the carry bits into and/or out of the most-significant bit)
Lecture 3 Page 1
(^0000 ) 0010
0011
0100
0101
0110 1001 1000 0111
1010
1011
1100
1101
1110
1111
a) List unsigned decimal values on the outside
b) List signed (two's complement) decimal values on the inside
c) Mark the point of unsigned overflow
d) Mark the point of signed overflow
"Initial Product" "Multiplier" "Previous bit"
Multiplicand 0 1 1 0
Multiplicand 1 0 1 0
Lecture 3 Page 2