closed by
718 views
0 votes
0 votes
closed as a duplicate of: GATE IT 2005 | Question: 8

Using Booth’s Algorithm for multiplication, the multiplier -57 will be recoded as
(A) 0 -1 0 0 1 0 0 -1
(B) 1 1 0 0 0 1 1 1
(C) 0 -1 0 0 1 0 0 0

(A+B+C)(A¯+B¯+C)

ABC+A¯(B⊕C)+B¯(A⊕C)
(D) 0 1 0 0 -1 0 0 1

Answer: (A)

found question here:http://quiz.geeksforgeeks.org/gate-gate-it-2005-question-8/

closed by

Related questions

22 votes
22 votes
3 answers
1
Ishrat Jahan asked Nov 3, 2014
8,460 views
Using Booth's Algorithm for multiplication, the multiplier $-57$ will be recoded as$0$ -$1$ $0$$0$ $1$ $0$ $0$ -$1$$1$ $1$ $0$ $0$ $0$ $1$ $1$ $1$$0$ -$1$ $0$ $0$ $1$$0$ ...
38 votes
38 votes
3 answers
2
Ishrat Jahan asked Oct 31, 2014
10,366 views
When multiplicand $Y$ is multiplied by multiplier $X = x_{n - 1}x_{n-2} \dots x_0$ using bit-pair recoding in Booth's algorithm, partial products are generated according ...
3 votes
3 votes
1 answer
4
admin asked Mar 31, 2020
1,477 views
How many Addition and Subtraction are required if you perform multiplication of $5$ (Multiplicand) and $-30$(Multiplier) using Booth Algorithm?$2,1$$1,2$$1,1$$2,2$