edited by
3,486 views
8 votes
8 votes

The two numbers given below are multiplied using the Booth's algorithm

Multiplicand $: 0101\; 1010 \;1110 \;1110$

Multiplier $: 0111\; 0111\; 1011\; 1101$

How many additions/subtractions are required for the multiplication of the above two numbers?

  1. $6$
  2. $8$
  3. $10$
  4. $12$
edited by

3 Answers

0 votes
0 votes
4 complete blocks so it requires 4 add 4 sub total 8
Answer:

Related questions

7 votes
7 votes
2 answers
2
go_editor asked Jun 14, 2016
5,577 views
Consider the following boolean function of four variables $f(w,x,y,z) = \Sigma(1,3,4,6,9,11,12,14)$, the function isIndependent of one variableIndependent of two variable...
6 votes
6 votes
1 answer
3
Desert_Warrior asked Jun 3, 2016
2,561 views
The switching expression corresponding to $f(\text{A, B, C, D}) = \Sigma(1, 4, 5, 9, 11, 12)$ isBC'D' + A'C'D + AB'DABC' + ACD + B'C'DACD' + A'BC' + AC'D'A'BD + ACD' + BC...
24 votes
24 votes
3 answers
4
Ishrat Jahan asked Oct 31, 2014
14,299 views
The addition of $4-bit$, two's complement, binary numbers $1101$ and $0100$ results in$0001$ and an overflow$1001$ and no overflow$0001$ and no overflow$1001$ and an over...