Step 1: Truth table
The output is high when either input is high but low when both are high. For inputs \((0,0)\): 0. \((0,1)\): 1. \((1,0)\): 1. \((1,1)\): 0.
Step 2: Gate
This is the XOR gate, \(Y = A\bar B + \bar AB\). OR gives 1 for \((1,1)\), so it fails. NAND gives 1 for \((0,0)\), and NOR gives 1 for \((0,0)\). Option (C).
Final Answer:
The gate is XOR.
\[ \boxed{\text{(C)}\ \text{X-OR}} \]