edited by
9,564 views
9 votes
9 votes

If half adders and full adders are implements using gates, then for the addition of two $17$ bit numbers (using minimum gates) the number of half adders and full adders required will be

  1. $0,17$
  2. $16,1$
  3. $1,16$
  4. $8,8$
edited by

5 Answers

Best answer
11 votes
11 votes
Option c ) 1 half adder 16 Full adder
4 votes
4 votes
Ans (c)

1 H.A    and   (n-1) F.A
1 votes
1 votes
Let the two 17 bit numbers be,

(a0 a1 a2 a3....a16)

(b0 b1 b2.........b16)

1 half adder will take input a16, b16 and return a sum and a carry. This carry will be forwarded to the next adder (full adder). The first full adder will take three inputs (the carry from previous stage, a15, b15) and generate the next sum and next carry for the second full adder. In this way, 16 full adders are used.

So, 1 H.A and 16 F.A (ans)
Answer:

Related questions

24 votes
24 votes
6 answers
1
Kathleen asked Sep 22, 2014
17,451 views
How many $32K \times 1$ RAM chips are needed to provide a memory capacity of $ 256K$ bytes?$8$$32$$64$$128$
9 votes
9 votes
5 answers
2
go_editor asked Jun 17, 2016
6,764 views
The boolean expression $\text{AB + A}\text{B}'+\text{A}'\text{C + AC}$ is independent of the boolean variable$\text{A}$$\text{B}$$\text{C}$None of these
10 votes
10 votes
6 answers
3
go_editor asked Jun 16, 2016
10,544 views
Minimum number of $2 \times 1$ multiplexers required to realize the following function, $f = \overline{A} \;\overline{B} C + \overline{A}\; \overline{B} \;\overline{C}$As...
10 votes
10 votes
4 answers
4
go_editor asked Jun 16, 2016
4,401 views
The complement of the Boolean expression $\text{AB}(\overline{\text{B}}\text{C + AC})$ is$(\overline{\text{A}} + \overline{\text{B}})+(\text{B} + \overline{\text{C}}). (\...