GATE | GATE CS 1996 | Question 23

Booth’s algorithm for integer multiplication gives worst performance when the multiplier pattern is
(A) 101010 ………1010
(B) 100000 ………0001
(C) 111111 ………1111
(D) 011111 ………1110

Answer: (A)
Explanation: The worst case of an implementation using Booth’s algorithm is when pairs of 01s or 10s occur very frequently in the multiplier.

So, option (A) is correct.

Quiz of this Question