Product of sums (POS) form

What is a POS?

HOW to build a maxterm (first principles)

WHAT we want: a single OR-term that is $0$ at exactly one row.

WHY complement the rule: An OR is $0$ only when every literal inside is $0$ . A literal $A$ is $0$ when $A=0$ ; a literal $\bar A$ is $0$ when $A=1$ . So to make the term $0$ at a chosen row, write each variable complemented if that variable is $1$ in that row.

Worked example — full derivation

Function: $F(A,B,C)=1$ except at rows $0,2,5$ .

#	A B C	F
0	0 0 0	0
1	0 0 1	1
2	0 1 0	0
3	0 1 1	1
4	1 0 0	1
5	1 0 1	0
6	1 1 0	1
7	1 1 1	1

Step 1 — pick $F=0$ rows: rows $0,2,5$ . Why? POS builds from zeros.

Step 2 — write each maxterm (complement a variable if it is $1$ in that row):

Row 0 ( $000$ ): all zero → $(A+B+C)$ .
Row 2 ( $010$ ): $B{=}1$ → $(A+\bar B+C)$ .
Row 5 ( $101$ ): $A{=}1,C{=}1$ → $(\bar A+B+\bar C)$ .

Step 3 — AND them: $F=(A+B+C)(A+\bar B+C)(\bar A+B+\bar C)$ Why AND? Each factor kills exactly its bad row (makes output $0$ ); ANDing lets any single $0$ dominate.

Shorthand notation

Common mistakes

Recall Feynman: explain to a 12-year-old

Imagine a light that should be ON almost all the time, but you know 3 "forbidden" button-combos that must turn it OFF. For each bad combo you install one tripwire that switches OFF only for that exact combo. Wire all tripwires in series (that's the AND): if any tripwire trips, the light goes off. So the light is OFF only for the 3 bad combos and ON for everything else. That series-of-tripwires is the Product of Sums!

Active recall

A POS (product of sums) form is an AND of what kind of terms?

Sum terms (ORs of literals); canonically, maxterms.

A maxterm

M_i

equals what value, and at how many rows?

Equals

0

at exactly one row (row

i

) and

1

at all other rows.

To build canonical POS, which truth-table rows do you use?

The rows where

F=0

In a maxterm, you complement a variable when its value in that row is?

1 (one). Plain literal when it is 0.

Why AND the maxterms together?

Because AND outputs 0 if any term is 0, so each maxterm forces 0 at its one bad row while others stay 1.

Derive POS from SOP of

\bar F

: what identity is used?

F=\overline{\bar F}=\overline{\sum m_i}=\prod \overline{m_i}=\prod M_i

(De Morgan;

\overline{m_i}=M_i

Maxterm for row

A{=}0,B{=}1,C{=}0

is?

(A+\bar B+C)

Notation

\prod M(0,2,5)

means?

Product of maxterms for rows 0, 2, 5 (the rows where

F=0

F=\sum m(1,3,4,6,7)

for 3 variables, its POS is?

\prod M(0,2,5)

(the complementary row set).

Connections

Sum of products (SOP) form — the dual; uses $F=1$ rows.
Minterms and maxterms — the atoms behind SOP/POS.
De Morgan's theorems — the engine converting minterm sums to maxterm products.
Truth tables — the source of both forms.
Karnaugh maps — grouping $0$ s gives simplified POS.
Logic gates — POS maps directly to an AND-of-ORs (two-level) circuit.

Concept Map

Hinglish (regional understanding)

Intuition Hinglish mein samjho

Dekho, POS (Product of Sums) ka funda simple hai. Kisi bhi Boolean function ko do tareeke se likh sakte ho: ya to bataओ kahan output 1 hai (that's SOP), ya bataओ kahan output 0 hai (that's POS). POS mein hum har us row ke liye ek "sum term" (yaani OR term) banate hain jahan $F=0$ hota hai, aur phir un sab terms ko AND kar dete hain.

Ab yeh crucial trick yaad rakho: sum term ke andar variable ko complement tab karte ho jab us row mein uski value 1 ho. Kyun? Kyunki OR gate sirf tabhi $0$ deta hai jab uske saare literals $0$ ho. To agar $A=1$ hai us bad row mein, to hum $\bar A$ likhte hain taaki wahan woh literal $0$ ban jaye. Isse har sum term apni ek "galat" row par exactly $0$ ho jaata hai, baaki jagah $1$ . Aur AND ka rule hai — koi ek bhi $0$ ho to poora output $0$ . Bas isi wajah se function apne saare $F=0$ rows par $0$ deta hai aur baaki jagah $1$ .

Sabse badi galti students yeh karte hain ki SOP ki aadat mein $F=1$ rows use kar lete hain. Nahi! POS mein hamesha zeros wali rows pick karo — mnemonic yaad rakho: "Pick Our Zeros, flip the ones". Ek aur baat: sum term ke andar sirf OR (plus) hota hai, andar AND mat ghusaao; AND to sirf brackets ke beech lagta hai.

Yeh matter isliye karta hai kyunki hardware mein POS seedha ek AND-of-ORs (two-level) circuit ban jaata hai. Interviews aur exams mein aksar SOP se POS convert karne ko bolte hain — remember, jo rows SOP mein chhoot gayi thi, wahi POS mein use hoti hain. Dono lists milke saari rows cover karti hain.

What is a POS?

HOW to build a maxterm (first principles)

Worked example — full derivation

Shorthand notation

Common mistakes

Active recall

Connections

Concept Map

Hinglish (regional understanding)

Go deeper — visual, from zero

Test yourself — Boolean Algebra & Logic Gates

Connections