0% found this document useful (0 votes)
19 views6 pages

Dlca 1

The document outlines the design and verification of truth tables for eight basic logic gates: AND, OR, NOT, NAND, NOR, XOR, XNOR, and Buffer. Each gate is described with its function, Boolean expression, logic symbol, and truth table. The document emphasizes the binary nature of inputs and outputs in logic circuits, represented as HIGH/LOW or TRUE/FALSE.

Uploaded by

Anubhuti Dutta
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
0% found this document useful (0 votes)
19 views6 pages

Dlca 1

The document outlines the design and verification of truth tables for eight basic logic gates: AND, OR, NOT, NAND, NOR, XOR, XNOR, and Buffer. Each gate is described with its function, Boolean expression, logic symbol, and truth table. The document emphasizes the binary nature of inputs and outputs in logic circuits, represented as HIGH/LOW or TRUE/FALSE.

Uploaded by

Anubhuti Dutta
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

EXPERIMENT 1

AIM: Design and verify the truth table of all 8 basic


logic gates.
Theory:
AND, OR and NOT gates are basic gates. XOR and XNOR are universal gates. Basically, logic
gates are electronic circuits because they are made up of number of electronic devices and
components. Inputs and outputs of logic gates can occur only in two levels. These two levels are
term HIGH and LOW, or TRUE and FALSE, or ON AND off, OR SIMPLY 1 AND 0. A table which
lists all possible combinations of input variables and the corresponding outputs is called a
„truth table‟. It shows how the logic circuits output responds to various combinations of logic
levels at the inputs.

AND GATE:-

An AND gate has multiple inputs and a single output. The output is 1 only when all inputs are 1;
otherwise, it is 0. It's often called an "all or nothing" gate, and the symbol for its operation is ..

With input variables A & B the Boolean expression for output can be written as;

X = A.B

Logic symbol: Truth table:

Input Output
1
A 3
X A B X
2
B
0 0 0
X = AB
0 1 0

1 0 0

1 1 1
.

CircuitVerse Diagrams:
EXPERIMENT 1

OR GATE
An OR gate has multiple inputs and a single output. The output is 1 if at least one input is 1; it is
0 only when all inputs are 0. It's known as an "any or all" gate and can also be called an inclusive
OR gate. The symbol for its operation is +. With input variables A & B the Boolean expression for
output can be written as;

X=A+B

Logic symbol: Truth table:

1 Input Output
A 3
X 2 A B X
B
0 0 0
X=A+B
0 1 1

1 0 1

1 1 1
CircuitVerse Diagram:

NOT GATE
A NOT gate, also called an inverter, has one input and one output. It outputs the opposite logic
state of its input: 1 if the input is 0, and 0 if the input is 1.

The symbol for NOT operation is „-„-‟(bar).

With input variable A the Boolean expression for output can be written as;

This is read as “X is equal to a bar”.


EXPERIMENT 1

Logic symbol: Truth table:


Input Output

A X

0 1

1 0

CircuitVerse Diagram:

NAND GATE
A NAND gate is a universal gate that can perform all basic logic functions. It
combines an AND gate and a NOT gate, outputting 0 only when all inputs
are 1. For any other input combination, the output is 1. A NAND gate is also
equivalent to a bubbled OR gate.

The logic symbol & truth table of two input NAND gate are shown in figure
with input variables A & B the Boolean expression for output

Logic symbol: Truth table:


EXPERIMENT 1
Input Output
A 1
A B X
3
2
B 0 0 1
X = A’B’
0 1 1

1 0 1

1 1 0
Circuitverse Diagram:

NOR GATE
NOR gate is universal gate. It can perform all the basic logic function. NOR means NOT OR that
is, OR output is [Link] NOR gate is combination of an OR gate and a NOT gate. The output is
logic 1 level, only when each of its inputs assumes a logic 0 level. For any other combination of
inputs, the output is logic 0 level. NOR gate is equivalent to a bubbled AND gate. The logic
symbol & truth table of two inputs NOR gate are shown in figure. With input variables A & B the
Boolean expression for output can be written as;

Logic symbol: Truth table:

Inpu Outpu
t t
A B X
0 0 1
0 1 0
1 0 0
Circuitverse Diagram: 1 1 0

EXCLUSIVE-OR (X-OR) GATE


An X-OR gate has two inputs and one output. The output is 1 when only one of the inputs is 1. If
both inputs are the same (0 or 1), the output is 0. It's also called an anti-coincidence gate or
EXPERIMENT 1
inequality detector. The X-OR gate's output is the modulo sum of its inputs. The Boolean
expression for the output, with inputs A and B, is A ⊕ B.

X= A

Logic symbol: Truth table:

Input Output
1
A 3
A B X
B X 2
0 0 0

0 1 1
X= A
1 0 1

1 1 0

Circuitverse Diagram:

Buffer Gate
A Buffer is another Logic Gate that has only one Input, its Output follows the same Logic State as the Input. The
Buffer is used as delay element in Digital Electronics. It is also a Current-Boost-Up element, which is used to
increase the capability of the Output of one gate to drive a number of other gates. The Schematic Symbol of a
Buffer is shown in its Truth-Table.

The notation of the logic operation of Buffer can be expressed by:

Simulated Diagram:
EXPERIMENT 1

What is XNOR gate?


An XNOR gate, or equivalence gate, outputs 1 when the number of 1 inputs is even. For
two inputs, it gives a 1 when both inputs are the same (0 or 1). It is the complement of
the XOR gate.
The mathematical representation of a two-input XNOR logic gate can be given as:

Here, “⊙” is the symbol representing the XNOR operation, “A” and “B” are inputs, and
“Y” refers to output.
Truth table of XNOR Logic Gate
A two-input XNOR logic gate is as follows:

Circuitverse Diagram:

You might also like