Sum
Express the following circuit in the symbolic form. Prepare the switching table:
Advertisement Remove all ads
Solution
Let p: the switch S1 is closed
q: the switch S2 is closed
r: the switch S3 is closed
Then the symbolic form of the given statement is:
(p∨q) ∧ (p∨q)
Switching Table
p | q | r | p∨q | p∨r | (p∨q) ∧ (p∨q) |
1 | 1 | 1 | 1 | 1 | 1 |
1 | 1 | 0 | 1 | 1 | 1 |
1 | 0 | 1 | 1 | 1 | 1 |
1 | 0 | 0 | 1 | 1 | 1 |
0 | 1 | 1 | 1 | 1 | 1 |
0 | 1 | 0 | 1 | 0 | 0 |
0 | 0 | 1 | 0 | 1 | 0 |
0 | 0 | 0 | 0 | 0 | 0 |
Concept: Application of Logic to Switching Circuits
Is there an error in this question or solution?
APPEARS IN
Advertisement Remove all ads