Scribd
Upload
30 views

Subject:-Computer Science Class: - XII Lesson No.: - 2 Topic: - Boolean Laws

The document discusses Boolean logic laws including: - Identity laws - Elementary laws - Associative laws - Commutative laws - Distributive laws - Complement laws - De Morgan's laws - Involution laws - Absorption laws Examples are provided to prove various laws using truth tables and other Boolean logic identities. Exercises are also included to simplify Boolean expressions using these laws.

Uploaded by

Aparichit Gupta
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
30 views

Subject:-Computer Science Class: - XII Lesson No.: - 2 Topic: - Boolean Laws

The document discusses Boolean logic laws including: - Identity laws - Elementary laws - Associative laws - Commutative laws - Distributive laws - Complement laws - De Morgan's laws - Involution laws - Absorption laws Examples are provided to prove various laws using truth tables and other Boolean logic identities. Exercises are also included to simplify Boolean expressions using these laws.

Uploaded by

Aparichit Gupta
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Subject :- Computer Science

Class :- XII
Lesson No. :- 2
Topic :- Boolean Laws

i) Indempotence Laws :-
• (A + A ) = A
• (A.A) = A
II) Elementary Laws :-
• (A+1) = (1+A) =1
• (A.1) = (1.A) =A
• (A+0) = (0+A) =A
• (A.0) = (0.A)= 0
III) Associative Laws:-
• (A+B)+C = A + (B+C)
• (AB). C = A. (BC)
IV) Commutative Laws :-
• (A + B) = (B+A)
• (AB) = (BA)
V) Distributive Laws :-
• A + (BC) = (A+B)(A+C)
• A.(B+C) = AB +AC
VI) Complementary Laws :-
• (A + A’) = 1
• (A . A’) = 0
VII) De’ Morgan’s Laws/theorems :-
• (A + B)’ = A’ . B’
• (A.B)’ = A’ +B’
VIII) Involution Laws :-
• (A’)’ = A
IX) Absorption Laws :-
• A + (AB) = A
• A . (A +B) = A
Lesson No. :- 2 (Continued ….. )

Proving Of Laws :-
1. State the Distributive laws. Prove any one using other Boolean laws.

• A + BC = (A +B ) (A+C)
• A . ( B+C) = AB + AC

RTP :- A + BC = (A +B ) (A+C)

R.H.S = (A +B) (A+C)


= A.A + AC + AB + BC
= A + AC + AB + BC [A.A = A, Indempotence Law]
= A(1 + C) + AB + BC
= A.1 + AB +BC [1 + A = 1, Elementary Law]
= A +AB +BC
= A(1+B) + BC
= A.1 + BC
= A + BC = L.H.S (Proved).

2. State and prove the De’ Morgan’s laws using a truth table.
• (A + B )’ + A’ +B’
• (AB)’ = A’ . B’

A B A’ B’ A + B AB (A+B)’ A’.B’ (AB)’ A’+B’


0 0 1 1 0 0 1 1 1 1
0 1 1 0 1 0 0 0 1 1
1 0 0 1 1 0 0 0 1 1
1 1 0 0 1 1 0 0 0 0

3. State and Prove Absorption Laws using other Boolean laws.


• A + AB = A
• A. (A +B) = A

RTP :- A + AB =A RTP :- A. (A + B) = A
L.H.S = A + AB L.H.S = A. (A +B)
= A(1 + B) = A.A + AB
= A.1 = A + AB
= A = R.H.S = A ( 1 + B)
= A.1
= A = R.H.S
Lesson No. :- 2 (Continued ….. )

1. Simplify :- X + (X + Y)’ = X + Y’

R.H.S = X + (X’ Y’)


= (X + X’) .(X +Y’)
= 1 ( X + Y’)
= X + Y’
= R.H.S

2. Using Boolean laws prove that [ p. (p’ + q) ]’ + q = 1

L.H.S = [p.(p’ + q)]’ + q


= [p.p’ + p.q]’ + q ( Distributive Law)
=[pq]’ + q ( a.a’ = 0 )
=p’+q’+q (Demorgan’s Law)
=p’+1 (Complementary law)
=1 (Properties of 1)
Exercise :-

1. Minimise F = AB + (AC)’ + AB’C (AB +C).


2. Simplify F= A’B + AB’C + A
3. Simplify F(a,b,c) = [(a’ + b) (b’+c)]’ + (a’ + c) .
4. Simplify X’Y’Z’ + X’Y’Z+X’YZ+X’YZ’+XY’Z’ + XY’Z using Boolean laws.
5. Simplify (ab + x + y + z) (ab + x’y’z’) using Boolean laws.
6. Simplify AB’ + A’BC’ + (AC)’ + BC
7. Simplify using Boolean laws [ (CD)’ + A]’ + A + CD +AB
8. Minimise F = P’Q + PQ’R + P using Boolean laws.
9. Write the expressions for (1),(2),(3)and (4) , reduce the final expression (4) using
Boolean laws. Mention the laws used.

x’ (1)
y

y’ (2) (4)
z

x’ (3)
z

10. Minimise F = ABC’ + ABC + A’B’C + AB’C + A’BC using Boolean laws.
11. State Absorption Laws and prove any one of them using Boolean laws.
12. Prove that (A+B)(A’ + C) = (A+B+C)(A+B+C’)(A’+B+C)(A’+B’+C) using Boolean
laws. Mention the laws used.

You might also like