3-input NOR, A = 0, B = 0, C = 1 — NOR gate

coreany high input forces the output low

Answer

output 0

Why this example is worth doing

One high input among three pulls the output low, because NOR's absorbing value is 1 inherited from OR. The page frames the wide NOR as an all-zeros detector, which is exactly the zero-flag circuit mentioned on the OR page, arrived at from the other side. Seeing the same hardware described twice from two starting points is worth more than either description alone.

Try your own input in the NOR gate. Truth table, symbol and algebraic form for (A + B)′, the other universal gate.

How the answer is reached

The probed row

A = 0, B = 0, C = 10Row 1 of 8.

Truth table

Truth table — columns #, A, B, C, A ↓ B ↓ C
#ABCA ↓ B ↓ C
00000
10010
20101
30110
41001
51010
61101
71110

Compare with

Open this example in the NOR gate

The field arrives filled in with this example’s input.

Note:

Notation this page assumes

  • Symbols: · is AND, + is OR, ⊕ is XOR, a prime or an overline is NOT. The field also takes ∧ ∨ ¬ ~ ! & | and the words.
  • Operator precedence, tightest first: NOT, then AND (including juxtaposition), then XOR/XNOR, then NAND/NOR, then OR, then IMPLIES, then IFF.
  • Gate symbols follow whichever standard the header toggle is set to: ANSI/IEEE Std 91-1984 distinctive shapes, or IEC 60617-12 rectangles.

Sources

  • ANSI/IEEE Std 91-1984, Graphic Symbols for Logic Functions
  • IEC 60617-12, Graphical Symbols for Diagrams — Binary Logic Elements