Difficulty: Easy
Correct Answer: NOR gate
Explanation:
Introduction / Context:
Recognizing gate truth tables quickly is crucial when analyzing or simplifying digital circuits. The NOR gate is the logical complement of OR: it outputs 1 only when all inputs are 0 and outputs 0 if any input is 1. This distinctive behavior makes NOR a universal gate (alone it can realize any Boolean function).
Given Data / Assumptions:
Concept / Approach:
By definition, NOR = NOT(OR). The OR function goes high when any input is high; complementing that yields an output that goes low whenever any input is high, and remains high only when all inputs are low.
Step-by-Step Solution:
Recall OR truth: any 1 at inputs → OR = 1.Apply inversion: NOR = NOT(OR).Therefore, any 1 at inputs → NOR = 0; all 0s → NOR = 1.Select “NOR gate.”
Verification / Alternative check:
Truth table check for two inputs: inputs (0,0)→1; (0,1)→0; (1,0)→0; (1,1)→0 for NOR, matching the statement.
Why Other Options Are Wrong:
AND: outputs 1 only when all inputs are 1, not described behavior.OR: outputs 1 if any input is 1, opposite behavior.EX-OR: outputs 1 when inputs differ, not described behavior.None: incorrect; NOR fits exactly.
Common Pitfalls:
Confusing NOR with NAND; remembering that NOR is the complement of OR, while NAND is the complement of AND.
Final Answer:
NOR gate
Discussion & Comments