Advertisements
Advertisements
Question
Construct the switching circuit for the following logical statement:
(p ∨ ∼ q) ∨ (q ∧ r). Also construct the switching circuit for its simplified form.
Sum
Solution
Let p: The switch S1
q: The switch S2
r: The switch S3
The switching circuit:
Now (p ∨ ∼ q) ∨ (q ∧ r)
= p ∨ [∼ q ∨ (q ∧ r)] ....(Associative law)
= p v [(∼q ∨ q) ∧ (∼ q ∨ r)] ....(Distributive law)
= p v [T ∧ (∼ q ∨ r)] ....(Complement law)
= p v [(∼ q v r)] .....(Identity law)
The simplified switching circuit is:
shaalaa.com
Is there an error in this question or solution?