Check whether the following switching circuits are logically equivalent - Justify.
Let p: the switch S1 is closed
q: the switch S2 is closed
r: the switch S3 is closed
The symbolic form of the given switching circuits is p ∧ (q ∨ r) and (p ∧ q) ∨ (p ∧ r) respectively.
By Distributive Law, p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r)
Hence, the given switching circuits are logically equivalent.