The AND gate outputs TRUE (1) only when all inputs are TRUE (1). If any input is FALSE (0), the output is FALSE.
Real-world analogy: Two switches in series - both must be closed for the light to turn on.
Boolean algebra: Y = A · B (or A AND B)
Applications:
Boolean algebra uses binary values (0 and 1) to represent FALSE and TRUE. Logic gates implement Boolean operations in hardware.
AND: D-shaped gate (multiplication)
OR: Shield-shaped gate (addition)
NOT: Triangle with circle (inversion)
NAND: AND gate with circle at output (universal gate)
NOR: OR gate with circle at output (universal gate)
XOR: Shield with extra line (exclusive OR)
XNOR: XOR with circle at output (equality)
NAND and NOR gates are called "universal gates" because any Boolean function can be implemented using only NAND gates or only NOR gates.
Important identities in Boolean algebra:
These laws show the relationship between AND/OR gates and their negated forms (NAND/NOR).