How many iterations are generally required by Booth’s algorithm to multiply two n-bit binary numbers?
Options
A.
n iterations
B.
2n iterations
C.
n² iterations
D.
2ⁿ iterations
E.
None of the above
Correct Answer (Detailed Explanation is Below)
A.
n iterations
Detailed Explanation
Correct Answer: (A) n iterations In the standard Booth multiplication algorithm, the procedure performs one iteration for each bit of the multiplier. Therefore, an n-bit multiplier generally requires n iterations.