Answer: B
Correct answer: True
The statement is true. An OR gate outputs 1 when any of its inputs is 1, and 0 only when every input is 0. Its Boolean expression is \( Y = A + B \). Its truth table for two inputs runs: 0,0 gives 0; 0,1 gives 1; 1,0 gives 1; 1,1 gives 1. Only the first row gives 0, which is why the OR gate is sometimes described by what makes it low rather than what makes it high. The contrast is with the AND gate, whose output is 1 only when all inputs are 1, expressed as \( Y = A \cdot B \). The gate to distinguish it from is XOR, exclusive OR, whose output is 1 when the inputs differ - so 1,1 gives 0 rather than 1. The ordinary OR is sometimes called inclusive OR for that reason. Note that the symbol \( + \) in Boolean algebra means OR, not addition, so \( 1 + 1 = 1 \).