Full Adder

Write the Boolean functions of a Full Adder (FA) and a Half Adder (HA), and derive the functions using Karnaugh maps.

Implement the Boolean function using logic gates. Count the number of transistors and logic levels required for the implementation.

It is possible to implement the Boolean function directly using transistors? If you are familiar with such an implementation, show the transistor-level design.