Scribd
Upload
404 views7 pages

Lab Experiment-ME - 12

The document describes Lab Experiment #12 which aims to implement and verify Boolean algebraic laws using logic gates. It discusses the basic logic gates - AND, OR, and NOT - and their truth tables. It also outlines several Boolean algebraic laws including distributive, identity, inverse, and idempotent laws. The lab tasks involve using logic gates to diagrammatically represent these laws and verify the output truths tables match the expected identities. The summary concludes that logic gates can model Boolean algebraic laws and functions are fundamental in digital electronics.

Uploaded by

Saad khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
404 views7 pages

Lab Experiment-ME - 12

The document describes Lab Experiment #12 which aims to implement and verify Boolean algebraic laws using logic gates. It discusses the basic logic gates - AND, OR, and NOT - and their truth tables. It also outlines several Boolean algebraic laws including distributive, identity, inverse, and idempotent laws. The lab tasks involve using logic gates to diagrammatically represent these laws and verify the output truths tables match the expected identities. The summary concludes that logic gates can model Boolean algebraic laws and functions are fundamental in digital electronics.

Uploaded by

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

EE-301 Lab Manual, ME Department, Wah Engineering College

Lab Experiment # 12
Implementation and verification of Boolean algebraic law’s using logic gates

Objective: To implement and verify Boolean algebraic law’s by using logic gates.

Apparatus:

 AND Gate
 OR Gate
 NOT Gate
THEORY:

LOGIC GATES:
A logic gate is an elementary building block of a digital circuit. Most logic gates have two inputs
and one output. At any given moment, every terminal is in one of the two binary
conditions low (0) or high (1), represented by different voltage levels. The logic state of a
terminal can, and generally does, change often, as the circuit processes data. In most logic gates,
the low state is approximately zero volts (0 V), while the high state is approximately five volts
positive (+5 V).

There are seven basic logic gates: AND, OR, XOR, NOT, NAND, NOR, and XNOR.

We used:

1. AND GATE:
The AND gate is so named because, if 0 is called "false" and 1 is called "true," the gate acts
in the same way as the logical "and" operator. The following illustration and table show the
circuit symbol and logic combinations for an AND gate. (In the symbol, the input terminals
are at left and the output terminal is at right.) The output is "true" when both inputs are
"true." Otherwise, the output is "false."

Figure-1 AND gate symbol

Input Input Outpu


EE-301 Lab Manual, ME Department, Wah Engineering College

1 2 t

 0  0  0

0  1  0

1  0 0 

1 1 1

Table-1

2. OR GATE:
The OR gate gets its name from the fact that it behaves after the fashion of the logical
inclusive "or." The output is "true" if either or both of the inputs are "true." If both inputs
are "false," then the output is "false."

Figure-2 OR gate Symbol

Input Input Outpu


1 2 t

 0  0 0 

 0 1 1

1 0  1

1 1 1

3. NOT GATE:
A logical inverter, sometimes called a NOT gate to differentiate it from other types of
electronic inverter devices, has only one input. It reverses the logic state.

Figure-3 NOT gate Symbol


EE-301 Lab Manual, ME Department, Wah Engineering College

Inpu Outpu
t t

1 0

0 1

Table-3

BASIC IDENTITIES OF BOOLEAN ALGEBRA:


There are several laws and properties of Boolean algebra similar to the linear algebra.
These laws can be verified through the Boolean operators. These operators are AND gate,
OR gate and NOT gate. the laws are as follow:
1. Commutative law:

A + B = B+A                 A . B = B. A

2. Distributive law:

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

3. Associate law:
(A+B)+C = A+(B+C)                                  (A . B) . C = A. (B. C)

4. Inverse law:
A.Ã = 0 A+Ã=1

5. Identity law:

A + 0 = A                          A . 1 = A

6. Null Law:

A + 1 = 1                          A . 0 = 0

7. Idempotent law:

A + A = A                        A. A = A

8. Compliment law:

A + A' = 1                       A . A'=0
EE-301 Lab Manual, ME Department, Wah Engineering College

These laws can be implemented using the Boolean Operators which are And, OR and NOT
gates.
1. Distributive law ( A+(B . C) = (A+B) . (B+C):

Diagrammatic Representation
2. Idempotent law:
 Idempotent law For OR (A + A =A):

 Inverse law for OR (A + Ã = 1):

where A= 0,1
3. Identity law:
 Law of Identity for AND ( A.1 = A):
EE-301 Lab Manual, ME Department, Wah Engineering College

where a = 0,1
 Law of Identity for OR (A+0 = A):

Diagrammatic
Representation

TASKS PERFORMED:

Distributive law:

Figure-4 Circuit diagram


EE-301 Lab Manual, ME Department, Wah Engineering College

Figure-5 Circuit diagram

RESULT:
A B C Y Z
0 0 0 0 0
0 0 1 0 0
0 1 0 0 0
0 1 1 1 1
1 0 0 1 1
1 0 1 1 1
1 1 0 1 1
1 1 1 1 1
Table-1
TASK # 3

Inverse Law:

Figure-6 Circuit diagram


EE-301 Lab Manual, ME Department, Wah Engineering College

Identity law:

Figure-7 Circuit diagram

Idempotent Law:

Figure-8 Circuit diagram

Conclusion:
Logic gates can be used as switches
Logic gates can be used to invert the input
Logic gates are used in digital electronics
Boolean identities can be used to get the desired output

You might also like