# Guide to Logic Gates: AND, OR, NOT, NAND, and NOR
> Learn the fundamentals of logic gates, truth tables, and transistor counts. A compact guide to the building blocks of modern digital computing.

Tags: logic-gates, digital-electronics, boolean-logic, computer-engineering, nand-gate, truth-table, circuit-design
## Logic Gates: The Digital Foundation
* Presentation by Saumya Singh covering the fundamental building blocks of digital circuits.

## What is a Logic Gate?
* Performs specific Boolean functions on binary inputs (1/0).
* Produces a single binary output.

## The AND Gate
* Output is High (1) only if ALL inputs are High.
* Truth Table: (0,0)->0; (0,1)->0; (1,0)->0; (1,1)->1.

## The OR Gate
* Output is High (1) if AT LEAST ONE input is High.
* Truth Table: (0,0)->0; (0,1)->1; (1,0)->1; (1,1)->1.

## The NOT Gate (Inverter)
* Implements logical negation.
* Input 1 results in Output 0; Input 0 results in Output 1.

## Physical Cost: Transistor Count (CMOS)
* NOT: 2 transistors
* NAND: 4 transistors
* NOR: 4 transistors
* AND: 6 transistors
* OR: 6 transistors
* XOR: 8 transistors

## The NOR Gate
* 'Not OR': Output is High only when all inputs are Low.
* Considered a Universal Gate.

## The NAND Gate
* 'Not AND': Output is Low only if all inputs are High.
* Universal Gate: can be used to build any other logic function.

## Logic in the Real World
* **Microprocessors**: Billions of gates form the CPU.
* **Memory**: Gates form latches and flip-flops.
* **Sensors**: Used in security systems (System Armed AND Motion Detected).
---
This presentation was created with [Bobr AI](https://bobr.ai) — an AI presentation generator.