Scribd
Upload
13 views

BOOLEANLOGIC_NOTES&ASSGN (1)

Uploaded by

ada.studies20
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views

BOOLEANLOGIC_NOTES&ASSGN (1)

Uploaded by

ada.studies20
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Logic gates

Digital systems are said to be constructed by using logic gates. These gates are the AND, OR, NOT, NAND,
NOR, EXOR /XOR and EXNOR/XNOR gates.

Logic gates are electronic circuits with one or more inputs but only one output

NOT Gate (Inverter)

The NOT gate is an electronic circuit that produces an inverted version of the input at its output. It is also
known as an inverter. If the input variable is A, the inverted output is known as NOT A. This is also shown
as A', or A with a bar over the top,

OR Gate

The OR gate is an electronic circuit that gives a high output (1) if one or more of its inputs are high. A plus
(+) is used to show the OR operation.

AND Gate

The AND gate is an electronic circuit that gives a high output (1) only if all its inputs are high. A dot (.) is
used to show the AND operation i.e. A.B. Bear in mind that this dot is sometimes omitted i.e. AB

NAND Gate

this is a NOT-AND gate which is equal to an AND gate followed by a NOT gate. The outputs of all NAND
gates are high if any of the inputs are low. The symbol is an AND gate with a small circle on the output. The
small circle represents inversion.
NOR Gate

This is a NOT-OR gate which is equal to an OR gate followed by a NOT gate. The outputs of all NOR gates are
low if any of the inputs are high.

The symbol is an OR gate with a small circle on the output. The small circle represents inversion.

EXOR or XOR Gate

The 'Exclusive-OR' gate is a circuit which will give a high output if either, but not both, of its two inputs are
high. An encircled plus sign () is used to show the EXOR operation.

EXNOR Gate

The 'Exclusive-NOR' gate circuit does the opposite to the EXOR gate. It will give a low output if either, but
not both, of its two inputs are high. The symbol is an EXOR gate with a small circle on the output. The small
circle represents inversion.

SUMMARY
DeMorgans Theorem

1. De Morgan;s First Theorem states that for A and B Boolean Variables -


(A+B)' = A'.B'
A B (A+B)' A' B' A'.B'
0 0 1 1 1 1
0 1 0 1 0 0
1 0 0 0 1 0
1 1 0 0 0 0

Algebraic proof -
Let P = A+ B

therefore P + P' =1 and P.P' = 0 (complementarity Law)

P P' P+P' P.P'

0 1 1 0

1 0 1 0

Thus (A+B) +(A+B)' = 1 and (A+B) .(A+B)' = 0 (will prove this)

1. But (A+B)' = A'.B' ( De Morgans first law)


Thus (A+B)+A'B' =1
(A+B+A')(A+B+B') (Using distributive law)
(1+B)(1+A) (because A+A'=1)
1.1 = 1 Hence proved ( Because 1+A=1 ) 1+A 1+0=1 1+1=1
2. (A+B).(A+B)'=0

(A+B).A'B' = AA'B + B A B' ( using DISTRIBUTIVE LAW)


0+0=0
Hence proved

2. De Morgan;s Second Theorem states that for A and b Boolean Variables -


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

A B (AB)' A' B' A'+B'


0 0 1 1 1 1
0 1 1 1 0 1
1 0 1 0 1 1
1 1 0 0 0 0
Algebraic proof -
Let P = AB
therefore P + P' =1 and P.P' = 0 (complementarity Law)

Thus (AB) +(AB)' = 1 and (AB) .(AB)' = 0 (will prove this)

1. But (AB)' = A+.B' ( De Morgans first law)


Thus (AB)+A'+B' =1
(A+B'+A')(A'+B'+B) (Using distributive law)
(1+B')(1+A') (because A+A'=1)
1.1 = 1 Hence proved ( Because 1+A=1 )

2. (AB).(AB)'=0

(AB).(A'+B') = AA'B + B A B' ( using DISTRIBUTIVE LAW)


0+0=0
Hence proved

Assignment Questions -
1. Draw (AND,OR) logic gates for 2,3,4 inputs with their symbols and Truth Table.

2. Draw circuit diagram for the following -

i) F(A,B,C,D)=AB'+C'D

II) F(A,B,C,D)=(A+B+C).D'

III) F(A,B,C)=A'+(BC + A)

IV) F(A,B,C,D)= ((ACD)'+BC')'

V) F(A,B,C,D)= (A'+B+C)(C+D)'

3. VERIFY THE TRUTHFULNESS OF FOLLOWING BOOLEAN EXPRESSIONS USING TRUTH TABLE -

I) A.(A+B) = A

II) X(Y+Z)=XY+XZ

4. State and prove DeMorgans theorem using truth table .

5. Identify the logical expression for the following circuits

i)

ii)
iii)

iv)

*******************************

You might also like