Q)State and prove D’Morgans law
A)De-Morgan's Theorem
1. The complement of product is equal to the sum of
complements.
2. The complement of sum is equal to the product of the
complements.
Boolean laws
Commutative Law
Involution law
(A’)’=A
D’Morgan’ law
Associative Law
Distributive Law
Absorption law
A.(A=B)=A
A+AB=A
Operator Precedence
The operator precedence for evaluating Boolean expressions is (1)
parentheses, (2) NOT, (3)AND, and (4) OR. In other words,
expressions inside parentheses must be evaluated before all
other operations. The next operation that holds precedence is the
complement, and then follows the AND and, finally, the OR.
Note that in ordinary arithmetic, the same precedence holds
(except for the complement) when multiplication and addition
are replaced by AND and OR, respectively.
DIGITAL CIRCUITS
Logic Gates
➢ Logic gates are the basic building blocks of any digital system.
➢ It is an electronic circuit having one or more than one input and
only one output.
➢ The relationship between the input and the output is based on
certain logic. Based on this, logic gates are named as AND gate,
OR gate, NOT gate etc.
Types of Logic Gates
➢ The various types of logic gates are
1. NOT Gate
2. AND Gate
3. OR Gate
4. NAND Gate
5. NOR Gate
6. XOR Gate (Exclusive-OR)
7. XNOR Gate (Exclusive-NOR)
Universal gates
➢ All the logic functions can be realized either using NAND gate
or NOR gate. Hence these gates are called as Universal gates
Basic gates
➢ Basic logic operation are NOT, AND & OR. Hence these gates
are called as basic gates.
OR Gate:
Y = A+B
In OR operation, the output is 0 only if both inputs A and B are 0;
otherwise it is one.
Truthtable
Symbol
AND Gate:
𝐘 = 𝐀∙𝐁
In AND operation, the output is 1 only if both inputs A and B are
1; otherwise it is zero.
Truth table
Symbol
NOT Gate
In NOT operation, the output is the complement of input.
Truth table
Symbol
NAND Gate:
In NAND operation, the output is 0 only if both inputs A and B are
1; otherwise it is one.
Truth table
Symbol
(If A=0, B=0 ,A.B=1 sice the complement of 0=1
If A=0,B=1, A.B=1 since the complement of A.B =1)
NOR Gate:
In NOR operation, the output is 1 only if both inputs A and B are
0; otherwise it is zero.
Truth table
Symbol
Q)Design half adder and implement it using logic gates
A half adder is a combinational logic circuit that performs the addition of
two single binary digits A and B and produces two output Sum(S) and
Carry (C)
Boolean expressions
From the truth table we can derive the Boolean expression fro the
outputs.
*Sum(S): The sum output is 1 only when the inputs A and B are
different.This is the defination of Exclusive OR (XOR) operation
S= A B (A XOR B)
*Carry(C):The Carry output is 1 only when both inputs A
and B are 1. This is the defination of And operation
C=A.B (A and B)
