Bitwise NOR: 0011 0110 ↓ 0100 0001 — NOR gate
exam standardOR then complement
Answer
10001000
Why this example is worth doing
Like NAND, no mainstream instruction set exposes NOR directly, so the byte-wide result is computed as an OR followed by a NOT. The page notes the historical exception — some architectures shipped NOR precisely because it was the cheap primitive — and uses it to observe that instruction sets are shaped by what was cheap when they were designed, which is why they disagree about which logical operations deserve an opcode.
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
Column by column
A00110110
B01000001
result10001000
| bit | A | B | result |
|---|---|---|---|
| 7 | 0 | 0 | 1 |
| 6 | 0 | 1 | 0 |
| 5 | 1 | 0 | 0 |
| 4 | 1 | 0 | 0 |
| 3 | 0 | 0 | 1 |
| 2 | 1 | 0 | 0 |
| 1 | 1 | 0 | 0 |
| 0 | 0 | 1 | 0 |