1-bit binary addition (sum and carry): Compute 1 + 1 and report the sum and carry.

Introduction / Context:
Single-bit addition defines the core behavior of ripple and CLA adders. Adding two ones produces a sum bit and a carry to the next stage.

Given Data / Assumptions:

• a = 1, b = 1, carry_in = 0.
• Standard full-adder equations.

Concept / Approach:
Sum = a xor b xor carry_in; Carry_out = majority(a, b, carry_in). With a=b=1 and carry_in=0, Sum=0 and Carry_out=1.

Step-by-Step Solution:

Verification / Alternative check:
Truth table of a half adder shows 1+1 → sum 0, carry 1.

Why Other Options Are Wrong:

Common Pitfalls:
Forgetting to include the carry signal when moving to the next bit.

Final Answer:
sum = 0 carry = 1