# Self Doubt

178 views
How is the no of gates required for array multiplier 2n-1,As much as I know we need for a m multiplier bit and n multiplicand bit mn and gates and m-1) adders to add the result of and gates?

## Related questions

1
5.5k views
The maximum gate delay for any output to appear in an array multiplier for multiplying two $n$ bit numbers is $O(n^2)$ $O(n)$ $O(\log n)$ $O(1)$
Consider an array multiplier for multiplying two $n$ bit numbers. If each gate in the circuit has a unit delay, the total delay of the multiplier is $\Theta(1)$ $\Theta(\log n)$ $\Theta(n)$ $\Theta(n^2)$
Consider a $3-bit$ number $A$ and $2 bit$ number $B$ are given to a multiplier. The output of multiplier is realized using $AND$ gate and one-bit full adders. If the minimum number of $AND$ gates required are $X$ and one-bit full adders required are Y, then $X+Y =$ _______