AND gate

An AND gate is a logic gate whose output is true only when every input is true. It implements logical conjunction in digital circuits.

Truth table: A table listing the output of a logical operation for every possible combination of inputs. The AND gate’s output is false for every input combination except the all-true row.
Logical conjunction: A logical operation that is true exactly when all of its operands are true. An AND gate is the hardware implementation of conjunction.
Half adder: A combinational circuit that adds two binary bits and produces a sum bit and a carry bit. Its carry output is the AND of the two input bits.
OR gate: A logic gate that outputs true when at least one input is true. Unlike an AND gate, an OR gate accepts any true input as sufficient.
Boolean algebra: An algebraic system for reasoning about variables and operations that take true-or-false values. Boolean algebra expresses the AND gate’s operation as multiplication-like conjunction.
Binary logic: A system of logic in which values are represented using two states, commonly 0 and 1. The gate’s true and false inputs correspond to the two states used in digital logic.
Full adder: A combinational circuit that adds three binary bits and produces sum and carry outputs. AND operations help combine the bit-pair carry conditions in common full-adder designs.
XOR gate: A logic gate that outputs true when an odd number of its inputs are true. For two inputs, XOR is true when exactly one is true, not when both are true.
CMOS logic: A digital circuit technology that uses complementary networks of p-type and n-type metal–oxide–semiconductor transistors. CMOS transistor networks implement AND functions efficiently, often through a NAND gate followed by an inverter.
Logic level: A voltage range interpreted by a digital circuit as a binary value. Physical inputs encode the true and false values that determine the gate’s output.

Linked from 8 pages