Difficulty: Easy
Correct Answer: A = 0, B = 0, C = 0
Explanation:
Introduction / Context:An OR gate implements the Boolean sum. In positive logic, a logic HIGH represents 1 and a logic LOW represents 0. Understanding when an OR gate outputs LOW is essential for designing enable lines, fault-detection logic, and combining asynchronous flags in digital electronics.
Given Data / Assumptions:
Concept / Approach:The Boolean OR operation yields 1 if any input is 1. Symbolically for three inputs: Y = A + B + C. The only case that produces Y = 0 is A = 0 and B = 0 and C = 0. Any single HIGH (or more) forces the output HIGH.
Step-by-Step Solution:
Write the OR expression: Y = A + B + C.Evaluate case A = 0, B = 0, C = 0 → Y = 0 + 0 + 0 = 0 (LOW).Evaluate case with any 1 present (for example A = 0, B = 0, C = 1) → Y = 1 (HIGH). The same holds for any combination including at least one 1.Therefore, the output is LOW only when all inputs are LOW.Verification / Alternative check:Create a short truth table subset. All-zero inputs produce LOW; any nonzero input vector (001, 010, 100, 011, 101, 110, 111) produces HIGH. This directly confirms OR behavior.
Why Other Options Are Wrong:
Common Pitfalls:Confusing OR with NOR (which inverts the result), or assuming that multiple LOW inputs are required to keep the output LOW even when a single HIGH is present. For OR, any HIGH dominates to produce a HIGH output.
Final Answer:A = 0, B = 0, C = 0
Discussion & Comments