Boolean Logic and Logic Circuits

Flashcards covering key concepts of Boolean logic, operations, truth tables, Karnaugh maps, and logic circuits.

Conjunction

An operation in Boolean logic that produces a true output only when both inputs are true (AND operation).

Disjunction

An operation in Boolean logic that produces a true output if at least one input is true (OR operation).

Negation

An operation in Boolean logic that reverses the truth value of an input (NOT operation).

Exclusive Disjunction

An operation that outputs true only when exactly one of the inputs is true (XOR operation).

Truth Table

A table showing every possible permutation of inputs to a logic gate and the corresponding output.

Karnaugh Map

A diagram used to simplify Boolean expressions by visually organizing the truth table values.

De Morgan’s Laws

A set of rules that describe how to break a negation and change the operator in Boolean algebra.

Distribution

A rule in Boolean algebra that applies to conjunction over disjunction and vice versa.

Association

A property that allows for the addition or removal of parentheses in a Boolean expression without changing its outcome.

Commutation

A principle stating that the order of literals around an operator in a Boolean expression does not matter.

Double Negation

A principle stating that negating a Boolean expression twice results in the original expression.

D-Type Flip Flop

A type of logic circuit that can store one bit of value, changing at the rising edge of the clock.

Half Adder

A logic circuit that adds two inputs and produces a sum and a carry output.

Full Adder

A logic circuit similar to a half adder, but with an additional input for carry, allowing for the chaining of adders.