Scribd
Upload
12 views3 pages

Digital Electronics Gates

The document describes seven types of logic gates: NOT, AND, OR, NAND, NOR, XOR, and XNOR, including their symbols, Boolean expressions, functions, and truth tables. Each gate performs a specific logical operation, such as inverting input, outputting high only when all inputs are high, or producing high output based on specific input conditions. A summary of key points highlights the primary function of each gate.

Uploaded by

sdas.cse21
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
12 views3 pages

Digital Electronics Gates

The document describes seven types of logic gates: NOT, AND, OR, NAND, NOR, XOR, and XNOR, including their symbols, Boolean expressions, functions, and truth tables. Each gate performs a specific logical operation, such as inverting input, outputting high only when all inputs are high, or producing high output based on specific input conditions. A summary of key points highlights the primary function of each gate.

Uploaded by

sdas.cse21
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/ 3

1.

NOT Gate (Inverter)


• Symbol: A triangle with a small circle on the output.
• Boolean Expression: Y=A
• Function: Outputs the opposite (inverted) logical state of the input.
• Truth Table:

A Y
0 1
1 0

2. AND Gate
• Symbol: A D-shaped gate with multiple inputs converging into it.
• Boolean Expression: Y=A⋅B (or A∧B)
• Function: Outputs 1 only if all inputs are 1.
• Truth Table (2-input case):

A B Y
0 0 0
0 1 0
1 0 0
1 1 1

3. OR Gate
• Symbol: A curved-shaped gate with multiple inputs converging into it.
• Boolean Expression: Y=A+B (or A∨B)
• Function: Outputs 1 if any input is 1.
• Truth Table (2-input case):

A B Y
0 0 0
0 1 1
1 0 1
1 1 1

4. NAND Gate
• Symbol: AND gate with a small circle (inversion bubble) on the output.
• Boolean Expression: Y=A⋅B
• Function: Outputs 0 only if all inputs are 1; otherwise 1.
• Truth Table (2-input case):

A B Y
0 0 1
0 1 1
1 0 1
1 1 0

5. NOR Gate
• Symbol: OR gate with a small circle (inversion bubble) on the output.
• Boolean Expression: Y=A+B
• Function: Outputs 1 only if all inputs are 0; otherwise 0.
• Truth Table (2-input case):

A B Y
0 0 1
0 1 0
1 0 0
1 1 0

6. XOR Gate (Exclusive OR)


• Symbol: OR gate with an extra curved line on the input side.
• Boolean Expression: Y=A⊕B
• Function: Outputs 1 if exactly one of the inputs is 1; otherwise 0.
• Truth Table (2-input case):

A B Y
0 0 0
0 1 1
1 0 1
1 1 0

7. XNOR Gate (Exclusive NOR)


• Symbol: XOR gate with a small circle (inversion bubble) on the output.
• Boolean Expression: Y=A⊕B or A⊙B
• Function: Outputs 1 if both inputs are the same; otherwise 0.
• Truth Table (2-input case):
A B Y
0 0 1
0 1 0
1 0 0
1 1 1

Summary of Key Points


1. NOT (Inverter): Flips the input.
2. AND: High output only when all inputs are high.
3. OR: High output if any input is high.
4. NAND: Inverted AND; outputs low only when all inputs are high.
5. NOR: Inverted OR; outputs high only when all inputs are low.
6. XOR: Outputs high when exactly one input is high.
7. XNOR: Outputs high when inputs match.

You might also like