edited by
2,895 views
1 votes
1 votes

Consider a full-adder with the following input values :

  1. $x=1, y=0$ and $C_i$(carry input)$=0$
  2. $x=0, y=1$ and $C_i =1$

Compute the value of S(sum) and $C_o$ (carry output) for the above input values :

  1. $S=1, C_o=0$ and $S=0, C_o=1$
  2. $S=0, C_o=0$ and $S=1, C_o=1$
  3. $S=1, C_o=1$ and $S=0, C_o=0$
  4. $S=0, C_o=1$ and $S=1, C_o=0$
edited by

3 Answers

0 votes
0 votes
Answer A)

Full adder takes 3 bit input and gives sum and carry as output.
0 votes
0 votes

In full adder:
For input x, y and Ci
So = x ⊕ y ⊕ Ci
Co = xy + Ci(x + y)


For x = 1, y = 0 and Ci(carry input) = 0
i.e. So = 1 ⊕ 0 ⊕ 0 = 1.
Co = 1*0 + 0(1 + 0) = 0.
For x = 0, y = 1 and Ci = 1
i.e. So = 0 ⊕ 1 ⊕ 1 = 0
Co = 0*1 + 1(0 + 1) = 1.


So, option (A) is correct.

0 votes
0 votes

Answer: A

For Full Adder 

SUM = A ⊕ B ⊕ $C_{i}$ 

CARRY = AB + B$C_{i}$  + $C_{i}$ A

a : SUM := 1 ⊕ 0 ⊕ 0 = 1       CARRY := 1*0 + 0*0 + 0*1 = 0

b : SUM := 0 ⊕ 1 ⊕ 1 = 0       CARRY := 0*1 + 1*1 + 1*0 = 1

Answer:

Related questions

0 votes
0 votes
4 answers
4
go_editor asked Jul 31, 2016
4,053 views
Which of the following algorithms sort $n$ integers, having the range $0$ to $(n^2 -1)$, in ascending order in $O(n)$ time?Selection sortBubble sortRadix sortInsertion so...