edited by
195 views

1 Answer

0 votes
0 votes

B. 1 half-adders, 15 full-adders


For LSB addition we do not need a full adder.

For addition of subsequent bits we need full adders since carry from previous addition has to be fed into the addition operation.

N Full adder= N-1 Full adder  + 1 half adder

                      N-1 (2 half adder + 1 OR gate ) + 1 half adder

                     2N-2+1 (half adder ) + N-1(OR gate )

                     2N-1 half adder + N-1 OR gate

Related questions

1 votes
1 votes
1 answer
1
soujanyareddy13 asked Jan 9, 2022
947 views
Let the predicates $D(x,y)$ mean “team $x$ defeated team $y$” and $P(x,y)$ mean “team $x$ has played team $y$”. The quantified formula for the statement that ther...
0 votes
0 votes
1 answer
2
soujanyareddy13 asked Jan 9, 2022
604 views
The File Transfer Protocol is built on ______________.data centric architectureservice-oriented architectureclient server architectureconnection-oriented architecture
0 votes
0 votes
1 answer
3
soujanyareddy13 asked Jan 9, 2022
529 views
More than one word is put in one cache block to:exploit the temporal locality of reference in a programexploit the spatial locality of reference in a programreduce the mi...
0 votes
0 votes
1 answer
4
soujanyareddy13 asked Jan 9, 2022
446 views
In $\text{DPSK}$ technique, the technique used to encode bits is :$\text{AMI}$Differential codeUnipolar $\text{RZ}$ formatManchester formate