A full-adder is a logic circuit which can add two single order bits plus a carry in from a previous adder. Its incomplete truth table is given in the table below. The missing entry in the outputs for SUM and CARRY out are
|
Input |
Outputs |
||||
|
A |
A |
B |
Cin |
Sum |
CarryOUT |
|
0 |
0 |
0 |
0 |
0 |
0 |
|
0 |
0 |
0 |
1 |
1 |
0 |
|
0 |
0 |
1 |
0 |
1 |
0 |
|
0 |
0 |
1 |
1 |
0 |
1 |
|
1 |
1 |
0 |
0 |
1 |
0 |
|
1 |
1 |
0 |
1 |
0 |
1 |
|
1 |
1 |
1 |
0 |
0 |
1 |
|
1 |
1 |
1 |
1 |
? |
? |
| A. | 0 0 |
| B. | 0 1 |
| C. | 1 0 |
| D. | 1 1 |
Answer : D Explanation : mahmoud said: (4:52am on Thursday 5th April 2018)
SUM =0 , CARRY=10 ?!!
|
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
