Question

12) Using Booth's Algorithm, solve (-16) X(+5). Fill in the details in the below table. (40 points) Count A Q Q M Comments

Answer 1

Q А count M Comments 110000 M O 6 000 lot we addi 001000 000010 110000 Q.Q-, 210 so we subtract and then sight shift and decrease count. Q.Q.-01 do M and then right shift and decrease count Q.Q.,310, 8. we subtract M and then right shift and decrease count 20-01, So we add M and then oight shift and decrease count 0.9.,:00, So only 4 111100 0 0000 I10000 3 000000 110000 0001100 2 100 000 000 O 11 00 00 right shift and decrease count 1 100000 0 110000 Q.Q.,200, do we only and decrease count right shift

After the last right shift will get Q As the count becomes 111110 11 0000 AQ is the answer le this is a's compliment 111110 110000 of value -80: .. (16)x (+5) = (-80) 111110 110000
We will have to iterate till count times count is the number of bits in the multiplicand.
Here we take 6 bits as we have to do 2's compliment of 16.
There will be 3 conditions :
1) if Q₀Q_-1 = 01 then we will subtract M from A then we right shift and decrement the count.
2) if Q₀Q-₁ = 10 then we will add the M to A then we right shift and decrement the count.
3) if Q₀Q_-1 = 00 or 11 then we will just right shift and decrement the count.​​​​​​

PLEASE DON'T FORGET TO LIKE...