Sum of products (SOP) form: Question bank — Hardware deep dive

Before we start, one shared picture: SOP is "OR the winners." Walk the truth table row by row; every row where the output is $1$ is a winner. For each winner you build one AND-term (a minterm) that shouts " $1$ !" only on its own row, then you OR all the shouts together. Keep that image ready — most traps here are about misremembering one moving part of it.

Quick vocabulary refresher so no symbol is unearned:

Literal = a variable either plain ( $A$ ) or barred ( $\overset{ˉ}{A}$ , read "not $A$ ").
Product term = literals joined by AND ( $\cdot$ ), e.g. $A \overset{ˉ}{B}$ .
Sum = terms joined by OR ( $+$ ).
Minterm = a product term that mentions every variable exactly once.
Canonical SOP = an SOP made purely of minterms.

True or false — justify

TRUE or FALSE: Every Boolean function can be written in SOP form.

TRUE — build one minterm per output-

1

row and OR them; this reconstructs the truth table exactly, so no function is left out. Even the all-zero function is covered (it is the empty OR, i.e.

F = 0

TRUE or FALSE:

A + \overset{ˉ}{B}

is already in SOP form.

TRUE — it is an OR of two terms, and each term (

A

\overset{ˉ}{B}

) is a product of one literal. A single literal counts as a (trivial) product, so this is valid, non-canonical SOP.

TRUE or FALSE:

(A + B) (A + C)

is in SOP form.

FALSE — the outer operation is AND (two OR-groups multiplied), which is the shape of POS, not SOP. To make it SOP you must distribute into

A + B C

TRUE or FALSE: In SOP,

1 + 1 = 2

FALSE — the

+

is OR, not arithmetic addition, so

1 + 1 = 1

. Boolean values only ever live in

{0, 1}

; there is no "

2

TRUE or FALSE: A minterm is

1

for exactly one input row.

TRUE — it ANDs every variable, so every literal must be satisfied simultaneously, which pins down one unique combination. Any other row flips at least one literal to

0

and kills the AND.

TRUE or FALSE: The term

A B

is a minterm of the function

F (A, B, C)

FALSE — over three variables a minterm must mention

C

too.

A B

is a valid product term but it fires on two rows (

A B C

and

A B \overset{ˉ}{C}

), so it is not a minterm here.

TRUE or FALSE: Simplifying an SOP with Boolean laws can change which rows output

1

FALSE — legal simplifications preserve the truth table by definition; they only reduce gate count. If your "simplified" version changes an output, you made an algebra error, not a simplification.

TRUE or FALSE: Two different-looking SOP expressions can describe the same function.

TRUE — e.g.

\overset{ˉ}{B} + A B

and

\overset{ˉ}{B} + A

have identical truth tables. Canonical (minterm) SOP is the unique form; simplified SOP is not unique.

TRUE or FALSE: The number of minterms in the canonical SOP equals the number of

1

s in the output column.

TRUE — one minterm is created per output-

1

row, so the counts match exactly. If

F = 1

on five rows, canonical SOP has five minterms.

Spot the error

Find the mistake: "Row

A = 1, B = 0

gives the minterm

\overset{ˉ}{A} B

The bars are inverted. Rule: a variable that is $0$ in the row gets barred, a variable that is $1$ stays plain — so this row gives

A \overset{ˉ}{B}

, not

\overset{ˉ}{A} B

. ("Zero gets a hat.")

Find the mistake: "To get SOP I list the rows where

F = 0

That builds POS, not SOP. SOP lists the output- $1$ rows ("OR the winners"); the

0

-rows are the POS job.

Find the mistake: "

F = A (B + \overset{ˉ}{C})

is SOP because it contains a sum inside."

The outermost operation is AND (an

A

multiplied by an OR-group), so this is a product-of-a-sum, not a sum-of-products. Distribute first:

F = A B + A \overset{ˉ}{C}

, then it is SOP.

Find the mistake: "I expanded

A

to canonical form by multiplying with

(B \cdot \overset{ˉ}{B})

B \overset{ˉ}{B} = 0

, so you multiplied by

0

and destroyed the term. The correct identity is multiply by

(B + \overset{ˉ}{B}) = 1

, giving

A = A B + A \overset{ˉ}{B}

Find the mistake: "In

F = \overset{ˉ}{A} \overset{ˉ}{B} + A \overset{ˉ}{B} + A B

the term

A \overset{ˉ}{B}

is redundant, so I deleted it to get

\overset{ˉ}{A} \overset{ˉ}{B} + A B

You cannot just delete a minterm — each represents a real output-

1

row, and dropping it turns that row to

0

. Redundancy is removed by combining (

\overset{ˉ}{A} \overset{ˉ}{B} + A \overset{ˉ}{B} = \overset{ˉ}{B}

), which still covers both original rows.

Find the mistake: "Every product term in an SOP must contain all variables."

Only canonical SOP requires full minterms. General (simplified) SOP allows short terms like

\overset{ˉ}{B}

that span several rows — that's the whole point of simplifying.

Find the mistake: "

A B + \overline{A + B}

is in SOP form."

The second term has a bar over an entire OR-group, which is not a product of literals — it's a complemented sum. SOP needs bars only on individual variables, so apply De Morgan first:

\overline{A + B} = \overset{ˉ}{A} \overset{ˉ}{B}

Why questions

WHY does a minterm use AND rather than OR internally?

AND demands all literals be

1

at once, which is what pins the term to a single exact row. OR would fire on many rows, so it could not act as a one-row detector.

WHY do we join the minterms with OR rather than AND?

OR outputs

1

if any term fires, so the function is

1

on every winning row and

0

elsewhere. ANDing them would require all rows to fire simultaneously — impossible — giving a constant

0

WHY is "

0 \to

barred variable" the correct complement rule?

We need the literal to equal

1

on that row. If the variable is

0

there, then

\overset{ˉ}{X} = 1

makes the literal true; a plain

X

would be

0

and kill the AND.

WHY does distributing AND over OR turn an expression into SOP?

Distribution (

A (B + C) = A B + A C

) pushes ANDs inward and lifts ORs to the outside, which is exactly the SOP shape (OR of AND-terms). It rearranges the algebra without changing any output.

WHY can K-maps shorten an SOP but never change its meaning?

A K-map groups adjacent output-

1

cells and each group is one product term covering those same rows — it only merges what was already there. The set of

1

-rows is untouched, so the function is identical.

WHY is canonical SOP unique but simplified SOP is not?

Canonical SOP is forced by the truth table (one minterm per

1

-row, no choices). Simplification offers several legal grouping orders, so different but equal expressions can result.

Edge cases

EDGE CASE: What is the canonical SOP of a function that is

1

on every row?

It ORs all

2^{n}

minterms, which simplifies to

F = 1

(a constant). Every input is a winner, so the "list of winners" is the whole table.

EDGE CASE: What is the SOP of a function that is

0

on every row?

There are no output-

1

rows, so the OR has no terms — the empty sum is

F = 0

. This is the one function with no minterms.

EDGE CASE: A single-variable function

F (A) = A

— is it valid SOP?

Yes. It is an OR of one product term, and that product is the single literal

A

. Both "sum" and "product" are allowed to have just one element.

EDGE CASE: Can a product term legally contain the same variable barred and plain, like

A \overset{ˉ}{A} B

It's syntactically a product term, but

A \overset{ˉ}{A} = 0

, so the whole term is constant

0

and detects no row. Such a term is always dropped in a real SOP.

EDGE CASE: If two rows both output

1

and differ in only one variable, must canonical SOP still list both minterms?

Yes — canonical form lists every

1

-row regardless of adjacency. Only simplification (or a K-map) may later merge those two minterms into one shorter term.

EDGE CASE: For

n

variables, how many distinct minterms exist?

Exactly

2^{n}

, one per possible input row, since each variable can be plain or barred independently. Any function's canonical SOP is a subset of these.

Connections

← Back to the parent SOP note
Truth Tables — every trap here ultimately checks a row of the table.
Minterms and Maxterms — the one-row-detector idea behind minterms.
Product of Sums (POS) form — the dual traps (list the $0$ -rows).
Karnaugh Maps — the "simplify without changing meaning" traps.
Boolean Algebra Laws — distribution, absorption, complement used above.
Logic Gates (AND, OR, NOT) — each product is an AND gate, ORed at the output.