1.

Design and Implement Half Adder and Half Subtractor using basic logic
gates.
2. Design and Implement Full Adder using Half Adders.
3. Design and Implement Full Subtractor using Half Subtractor.
4. Implement 3 bit Binary to Gray Code converter as well as 3 bit Gray to
Binary converter.
5. Implement the given Boolean function using NAND gates only:F(A,B,C,D) = m(0, 2, 5, 7, 8, 10, 13, 15)
6. Implement the given Boolean function using NOR gates only:F(A,B,C,D) = M(0, 2, 5, 7, 8, 10, 13, 15)
7. Implement two input AND gate and two input OR gate using diode resistor
logic.
8. Simplify using Quine McCluskey method and implement using basic
gates:F(X,Y,Z) = m(1, 2, 3, 7)
9. State and verify consensus theorem using NAND gates only.
10. State

and verify demorgans theorem using NAND gates only.