one extra step is done whenever at LSB $10$ or $01$ is seen.

The Gateway to Computer Science Excellence

+1 vote

Booth's Multiplication Algorithm reduces the number of additions and substractions done during the multiplication.

The number of additions done is equals to the number of times **+1** occurs in Booth recoded multiplier and number of substraction is equals to number of times **-1** occurs in it. So the worst case occurs when pairs of **01**s or **10**s occur very frequently in the multiplier, as it increases the number of +1 and -1 in the multiplier...

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,385 answers

198,557 comments

105,369 users