Lecture 10a: Introduction to Computer Engineering

These flashcards cover key vocabulary and concepts from the lecture on computer engineering, focusing on Boolean laws and simplification methods.

DeMorgan’s Theorem

The principle stating that the complement of the product is the sum of the complements.

Implicant

A product of literals in a Boolean expression.

Literal

A variable or its complement.

Distributivity

A property that states B(C+D) = BC + BD.

Covering

A method in simplification which states A + AP = A.

Combining

A method in simplification which states PA + PA = P.

Null Element

The role of an element which does not change the identity in an equation.

Identity

The element that, when used in an operation, does not change the other element.

Consensus Theorem

A formula that allows reduction of expressions by using combinatory rules.

Simplification Theorem

A theorem stating that PA + A = P + A.

Associativity

A property that states (B•C)•D = B•(C•D) and (B+C)+D = B+(C+D).

Duplication

A method in simplification which states A = A + A.

Expansion

A method in simplification which states P = PA + PA.

Idempotency

A property that states AA = A.

Complement

The operation that inverts a Boolean variable.

Duality

The principle that every operation or relation can be swapped for its dual.