AND Gate and Truth Table

Front

AND Gate

Back

Both inputs must be true for a true output. Y = A ullet B

Front

Truth Table for AND Gate

Back

Inputs: A = 0, B = 0, Output: Y = 0 Inputs: A = 0, B = 1, Output: Y = 0 Inputs: A = 1, B = 0, Output: Y = 0 Inputs: A = 1, B = 1, Output: Y = 1

Front

OR Gate Truth Table

Back

- Input A: 0, Input B: 0, Output Y: 0 - Input A: 0, Input B: 1, Output Y: 1 - Input A: 1, Input B: 0, Output Y: 1 - Input A: 1, Input B: 1, Output Y: 1

Front

OR Gate Function

Back

Only one input needs to be true for a true output. The expression is Y = A + B.

Front

Diagram of an OR Gate

Back

The OR gate symbol shows two inputs (A and B) leading to an output (Y).

Front

NOT Gate

Back

A NOT gate reverses a single input for a single output. The output Y is the inverse of input A, represented as Y = A̅.

Front

Truth Table for NOT Gate

Back

Input A: 0, Output Y: 1 Input A: 1, Output Y: 0

Front

NOR Gate Truth Table

Back

- Inputs: A = 0, B = 0 → Output: Y = 1 - Inputs: A = 0, B = 1 → Output: Y = 0 - Inputs: A = 1, B = 0 → Output: Y = 0 - Inputs: A = 1, B = 1 → Output: Y = 0

Front

Diagram of a NOR Gate

Back

A NOR gate outputs true only when both inputs are false.

Front

Function of a NOR Gate

Back

Both inputs must be false for a true output. The expression is Y = ¬(A + B).