LAB MANUAL - Computer Organization & Architecture
1. Design of Half Adder Circuit
Theory: A Half Adder is a combinational circuit that performs the addition of two binary digits (A and
B). It has two outputs: Sum (S) and Carry (C). The Sum represents the XOR operation, and the
Carry represents the AND operation of the inputs.
Truth Table:
A | B | Sum (S) | Carry (C)
0|0|0|0
0|1|1|0
1|0|1|0
1|1|0|1
Boolean Logic:
Sum = A XOR B
Carry = A AND B
Steps to Design:
- Prepare two inputs, A and B.
- Connect the inputs to an XOR gate to compute the Sum output.
- Connect the inputs to an AND gate to compute the Carry output.
- Combine and test the circuit against the truth table.
Applications:
Used in arithmetic circuits like adders and ALUs.
2. Design of Full Adder Circuit
Theory: A Full Adder adds three binary bits: two operand bits (A and B) and an input carry bit (Cin).
It outputs a Sum (S) and a Carry-Out (Cout). It builds upon the Half Adder by incorporating the
Carry-In functionality.
Truth Table:
A | B | Cin | Sum (S) | Cout
0|0|0|0|0
0|0|1|1|0
0|1|0|1|0
0|1|1|0|1
1|0|0|1|0
1|0|1|0|1
1|1|0|0|1
1|1|1|1|1
Boolean Logic:
Sum = A XOR B XOR Cin
Carry = (A AND B) OR (Cin AND (A XOR B))
Steps to Design:
- Take three inputs: A, B, and Cin.
- Use XOR gates to compute the Sum output.
- Use AND and OR gates to compute the Carry-Out output.
- Validate the circuit using the truth table.
Applications:
Used in ripple-carry adders and arithmetic logic units.
