BOOLEAN THEOREMS:

(i) Theorem 1 (DeMorgan):

(a) (A . B)' = A' + B'

IC1-AND GATE IC2-NOT GATE IC2-NOT GATE. IC3-OR

(b) (A + B)' = A' . B'

IC1-OR GATE IC2-NOT GATE. IC3-AND GATE

Output Table:
INPUTS OUTPUTS INPUTS OUTPUTS
A B (A.B)' A' + B' A B (A + A'. B'
B)'
0 0 1 1 0 0 1 1
0 1 1 1 0 1 0 0
1 0 1 1 1 0 0 0
1 1 0 0 1 1 0 0

(ii) Theorem 2 (Absorption):

(a) A + (A.B) = A (b) A.(A + B) = A

IC1-AND. IC2-OR IC1-OR. IC2-AND

Output Table:
INPUTS OUTPUTS INPUTS OUTPUTS
A B A.B A + A B A + B A.(A +
(A.B) B)
0 0 0 0 0 0 0 0
0 1 0 0 0 1 1 0
1 0 0 1 1 0 1 1
1 1 1 1 1 1 1 1

(iii) Theorem 3 (Distributive):

2
 (a) A + (B.C) = (A + B) . (A + C)
(b)
IC1-AND. IC2-OR IC2-OR. IC1-AND

Expt. No.: 1
VERIFICATION OF BOOLEAN THEOREMS USING DIGITAL

Date: 2/09/2021 LOGIC GATES

Aim:
To verify the Boolean theorems using Digital logic gates.

Components Required:

S. No. Description Specification Quantity

1. 2-input AND Gate IC 4081/7408 1
2. 2-input OR Gate IC 4071/7432 1
3. NOT Gate IC 4069/7404 1
4. Digital Trainer Kit - 1
5. Bread board - 1
6. Power Supply 5V 1
7. Connecting wires - As Required

Procedure:

(i) Make the connections as per the logic diagram.

(ii) Switch on the power supply.
(iii) Apply various combinations of inputs according to the truth table and observe condition of
output LEDs.
(iv) Note down the output as ‘1’ when the LED is ‘ON’ and as ‘0’ when the LED is ‘OFF’.

3
Output Table:
INPUTS OUTPUTS
A B C B.C A + (B . C) A+B A+C (A + B) . (A + C)
0 0 0 0 0 0 0 0
0 0 1 0 0 0 1 0
0 1 0 0 0 1 0 0
0 1 1 1 0 1 1 1
1 0 0 0 1 1 1 1
1 0 1 0 1 1 1 1
1 1 0 0 1 1 1 1
1 1 1 1 1 1 1 1

(c) A . (B + C) = (A.B) + (A.C)

IC 1- OR GATE. IC2- AND GATE. IC2- AND GATE. IC1- OR GATE

Output Table:
INPUTS OUTPUTS
A B C B+C A . (B +C) A.B A.C (A . B) + (A . C)
0 0 0 0 0 0 0 0
0 0 1 1 0 0 0 0
0 1 0 1 0 0 0 0
0 1 1 1 0 0 0 0
1 0 0 0 0 0 0 0
1 0 1 1 1 0 1 1
1 1 0 1 1 1 0 1
1 1 1 1 1 1 1 1

(iv) Theorem 4 (Associative):

4
 (a) A + (B + C) = (A + B) + C

IC1=OR GATE

Output Table:
INPUTS OUTPUTS
A B C B+ A + (B +C) A + B (A + B) + C
C
0 0 0 0 0 0 0

0 0 1 1 1 0 1

0 1 0 1 1 1 1

0 1 1 1 1 1 1

1 0 0 0 1 1 1

1 0 1 1 1 1 1

1 1 0 1 1 1 1

1 1 1 1 1 1 1

(b) A . (B.C) = (A.B) .C

IC1- AND.

Output Table:
INPUTS OUTPUTS
A B C B.C A . (B . C) A . B (A . B) . C

0 0 0 0 0 0 0

0 0 1 0 0 0 0

0 1 0 0 0 0 0

0 1 1 1 0 0 0
5
 1 0 0 0 0 0 0

1 0 1 0 0 0 0

1 1 0 0 0 1 0

1 1 1 1 1 1 1

Result:

The Boolean theorems were verified using Digital logic gates.

PREPARATION 30
LAB PERFORMANCE 30
REPORT 40
TOTAL 100

INITIAL OF FACULTY