DE 4:-

Que1)State and prove De-morgans theorem with logical diagram and truth table

De Morgan’s Theorem
De Morgan’s theorems are two transformation rules that simplify complex Boolean expressions. They describe
the equivalence between logic operations involving AND, OR, and NOT.

First Theorem:
A⋅B‾=A‾+B‾\overline{A \cdot B} = \overline{A} + \overline{B}
Statement: The complement of the AND of two variables is equal to the OR of their complements.

Second Theorem:
A+B‾=A‾⋅B‾\overline{A + B} = \overline{A} \cdot \overline{B}

Statement: The complement of the OR of two variables is equal to the AND of their complements.

Proof Using Truth Table

First Theorem: A⋅B‾=A‾+B‾\overline{A \cdot B} = \overline{A} + \overline{B}
A⋅B‾\overline{A A‾+B‾\overline{A}
A B A⋅BA \cdot B A‾\overline{A} B‾\overline{B}
\cdot B} + \overline{B}

0 0 0 1 1 1 1

0 1 0 1 1 0 1

1 0 0 1 0 1 1

1 1 1 0 0 0 0

✅ Since A⋅B‾\overline{A \cdot B} and A‾+B‾\overline{A} + \overline{B} have the same outputs, the theorem is
proved.

Second Theorem: A+B‾=A‾⋅B‾\overline{A + B} = \overline{A} \cdot \overline{B}

A+B‾\overline{A A‾⋅B‾\overline{A}
A B A+BA + B A‾\overline{A} B‾\overline{B}
+ B} \cdot \overline{B}

0 0 0 1 1 1 1

0 1 1 0 1 0 0

1 0 1 0 0 1 0

1 1 1 0 0 0 0

✅ Since A+B‾\overline{A + B} and A‾⋅B‾\overline{A} \cdot \overline{B} have the same outputs, the theorem is
proved.

Logical Diagrams
First Theorem:

DE 4:- 1
 A⋅B‾=A‾+B‾\overline{A \cdot B} = \overline{A} + \overline{B}

Logic Circuit Representation:

1. LHS (A⋅B‾\overline{A \cdot B}):

Use an AND gate for .

A⋅BA \cdot B

Apply a NOT gate to get .

A⋅B‾\overline{A \cdot B}

2. RHS (A‾+B‾\overline{A} + \overline{B}):

Apply NOT gates to A and B separately to get and .

A‾\overline{A}

B‾\overline{B}

Use an OR gate to combine them.

Diagram:

A ----| | A ----|O|--\
| AND |---|O| | OR |---- Output
B ----| | B ----|O|--/

(Here, |O| represents a NOT gate)

Second Theorem:
A+B‾=A‾⋅B‾\overline{A + B} = \overline{A} \cdot \overline{B}

Logic Circuit Representation:

1. LHS (A+B‾\overline{A + B}):

Use an OR gate for .

A+BA + B

Apply a NOT gate to get .

A+B‾\overline{A + B}

2. RHS (A‾⋅B‾\overline{A} \cdot \overline{B}):

Apply NOT gates to A and B separately to get and .

A‾\overline{A}
B‾\overline{B}

Use an AND gate to combine them.

Diagram:

A ----|O|--\ A ----|O|----\
| OR |--|O| | AND |---- Output
B ----|O|--/ B ----|O|----/

DE 4:- 2
 Conclusion
De Morgan’s Theorems help simplify Boolean expressions and are essential in digital logic design. The truth
tables and logic diagrams confirm their validity.

Que4) What is K-map?Explain three variable K-map with suitable example

What is a K-map?
A Karnaugh Map (K-map) is a graphical method used to simplify Boolean algebra expressions. It helps minimize
logical expressions by grouping adjacent cells that contain ones (1s), reducing the number of terms in an
equation. It is a useful tool for designing digital circuits efficiently.

Three-Variable K-map
A three-variable K-map is a 2×4 or 4×2 grid used to simplify Boolean expressions with three variables (e.g., A, B,
and C). It consists of 8 (2³) cells, each representing a minterm corresponding to a unique combination of the
three variables.

K-map Layout for Three Variables (A, B, C)

AB \ C 0 1

00 m0 m1

01 m2 m3

11 m6 m7

10 m4 m5

Each cell represents a minterm (m):

m0 = A'B'C'

m1 = A'B'C

m2 = A'BC'

m3 = A'BC

m4 = AB'C'

m5 = AB'C

m6 = ABC'

m7 = ABC

Example:
Consider a Boolean function:
F(A,B,C)=Σ(1,3,5,6)F(A, B, C) = Σ(1, 3, 5, 6)

This means F = m1 + m3 + m5 + m6, so we place 1 in these cells:

AB \ C 0 1

00 0 1

01 0 1

DE 4:- 3
 11 1 0

10 0 1

Grouping and Simplification:

1. Group adjacent 1s in pairs, quads, or octets:

(m1, m3) → B'C

(m5, m6) → AC'

Thus, the simplified expression is:

F(A,B,C)=B′C+AC′F(A, B, C) = B'C + AC'

This minimized expression can be used for efficient circuit design.

DE 4:- 4