(i) Let p : the switch S1 is closed
q : the switch S2 is closed
~p : the switch S1' is closed or the switch S1 is open
~ q : the switch S2' is closed or the switch S2 is open.
Then the symbolic form of the given circuit is :
(p ∨ ~q) ∨ (~p ∧ q)
Since the final column contains all' 1′,
The lamp will always glow irrespective of the status of switches.
(ii) Let p : the switch S1 is closed
q : the switch S2 is closed
~p : the switch S1 is closed or the switch S1 is open.
~q : the switch S1 is closed or the switch S2 is open.
Then the symbolic form of the given circuit is :
p ∨ (~p ∧ ~q) ∨ (p ∧ q)
Since the final column contains '0' when p is 0 and q is '1', otherwise it contains ‘1′.
Hence,
The lamp will not glow when S1 is OFF and S2 is ON, otherwise the lamp will glow.
(iii) Let p : the switch S1 is closed
q : the switch S2 is closed
r : the switch S3 is closed
~q : the switch S2' is closed or the switch S2 is open
~r: the switch S3' is closed or the switch S3 is open.
Then,
The symbolic form of the given circuit is :
[p ∨ (~q) ∨ r)] ∧ [p ∨ (q ∧ r)]
From the switching table,
The ‘final column’ and the column of p are identical.
Hence,
The lamp will glow which S1 is ‘ON’.