Discussion
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 Answer: D Correct answer: 1 1 For \(A=1, B=1, C_{in}=1\) the three inputs total three. The sum bit is the total modulo 2, which is 1, and the carry out is 1 because the total is 2 or more. In XOR terms, \( 1\oplus 1\oplus 1 = 1 \), and the carry is the majority of the three inputs.
No comment is present. Be the first to comment.
Loading…
Post your commentPlease log in or register to post a comment. Examination Categories
| |