Assignment No.

2
Draw the symbol and truth lable of AND and OR gate.
Give the name of universal gate. Why they called as universal gate?
List any four Boolean laws.
Draw truth table of 3 inputs EX-OR gate. Draw its symbol. Also give its output expression.
Define De-Morgans theorem and prove it.
Implement the following logical expression using gates

B C AC .
i) Y A
B A B A B ii) Y A
Implement the Boolean expression using NOR gate only

Y A
B C A C
Draw the symbol and truth table of:
1) EX-OR gate
2) NAND gate
State the meaning of universal gate. Name the universal gates.
Construct the AND and OR gate using NAND gate. Write necessary outputs of gates.
State De-Morgans theorems and prove for two inputs.
Reduce the following logic expression using Boolean laws and De-Morgans theorems

Reduce the given logic expression using Boolean laws and draw
NAND logic circuit.

Y A A B A B
Using Boolean laws, simplify the expression:

Y = A ( A C) ( A B + C )
State De-Morgans first and second theorem.
Draw logical symbol, truth table and logical expression of EX-OR gate.
Implement OR and AND gates by using NAND gates only
Draw logical symbol, truth table and logical expression for NAND and NOR gate.
Simplify the following Boolean expressions using Boolean laws.

Reduce the following expression and implement it using logic gates.

Reduce the following expression and implement logic gates.

Y ABABCA
B (E F)
Draw symbol and truth table of 3 i/p OR gate.
State DeMorgans theorem.
List any four Boolean laws.
Design OR and AND gate using NOR gate only.
Draw X-OR gate using NAND gate only. Also write O/P of each gate.
Simplify the following equation using Boolean laws and realize it using basic

B C
gates only. Y = ABC + A B C + A BC + A
Simplify using DeMorgans theorem and realize it using basic gates.
A B)(
AB+ A B)
Y = ( A B+
Simplify the following and realize it.

State any two boolean laws.

Draw symbol, logical expression and truth table of EX-OR gate.
Derive AND gate and OR gate using NAND gates only.
State and prove Demorgans theorems.
Derive NOT gate and AND gate using NOR gates only.
Simplify the following Boolean expressions using Boolean laws:

Implement the logical expression using gates.

Design a circuit using basic logic gates to realize the following function.