← Quiz: Computer Arithmetic: all 10 questions
Quiz: Computer Arithmetic · Question 10 of 10
Why does Booth's algorithm need an extra bit in A and M when the multiplicand is the most negative number (for example…
Why does Booth's algorithm need an extra bit in A and M when the multiplicand is the most negative number (for example −8 in 4 bits)?
- A.Booth's algorithm cannot multiply negative numbers at all
- B.The multiplier becomes zero
- C.Its negative (+8) does not fit in 4-bit 2's complement, so A − M overflows
- D.The shift becomes logical instead of arithmetic
Answer & explanation
Correct answer: Its negative (+8) does not fit in 4-bit 2's complement, so A − M overflows
With n bits the range is −8 to 7; one extra bit gives room for +8.
Can you get the rest right without peeking?
Take the timed Quiz: Computer Arithmetic quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →