You are on page 1of 7

LAB EXPERIMENT 1

Lab Title:
Verify two input and three input AND gate, OR gate and also NOR
Gate.
Lab Equipment:
 Trainer set
 Wires
 Voltage
Aims:
 The aim of this experiment is to verify the two input AND gate.
 To verify three input AND gate.
 To verify two input OR gate.
 To verify three input OR gate.
 And to verify NOT gate (Inverter).

Task No 1.
1. ) AND Gate Description:
 AND gate is a digital logic gate that performs the logical AND
operation.
 AND gate has two Inputs or three inputs and one output.
 In AND gate if any of the input has false the output will be also
false.
 The output of an AND gate will be true when all the inputs are
true.
 The Boolean expression for an AND gate with inputs A and B is
usually represented as A.B.
Two Input AND Gate:
Truth Table

A B A.B

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

Logic Diagram

Boolean Expression

Q = A.B
Three Input AND Gate:
Truth Table

A B C A.B.C

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

Logic Diagram

Boolean Expression
x = a. b. c
Task No 2.
2. ) OR gate description:
 An OR gate is a digital logic gate that performs a logical OR
operation.
 It has two or more input terminals and one output terminal.
 The output of an OR gate is high (1) if at least one of its input
signals is high (1).
 In terms of Boolean algebra, the output of an OR gate is
expressed as Q=A+B for a two-input or three input OR gate,
where A and B and C are the input signals, and Q is the output.

Two Input OR Gate:


Truth Table

A B A+B

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

Logic Diagram:

Boolean Expression
Q=A+B

Three Input OR Gate:


Truth Table

A B C A.B.C

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

Logic Diagram
Boolean Expression
Q = A+B+C

Task No 3.
NOT Gate (Inverter)
Description:
 It has a single input terminal and a single output
terminal.
 The output of a NOT gate is the logical negation of its
input.
 If the input is high (1), the output is low (0), and if the
input is low (0), the output is high (1).
 In terms of Boolean algebra, the output of a NOT gate is
expressed as Q = |A| for an input A and an output Q,
where A is the input signal.
Truth Table
A |A|
0 1
1 0

Logic Diagram

You might also like