Question
Check whether the following switching circuits are logically equivalent – Justify.
Image

Answer

The symbolic form of the given switching circuits are
(p ∨ q) ∧ (p ∨ r) and p ∨ (q ∧ r)
By Distributive Law,
p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r)
Hence, the given switching circuits are logically equivalent.

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free