Advertisements
Advertisements
प्रश्न
Simplify the following circuit so that the new circuit has minimum number of switches. Also, draw the simplified circuit.
Advertisements
उत्तर
Let p: The switch S1 is closed.
q: The switch S2 is closed.
∼p: The switch `S_1^′` is closed or the switch S1 is open.
∼q: The switch `S_2^′` is closed or the switch S2 is open.
Then the given circuit in symbolic form is:
(p ∧ ∼q) ∨ (∼p ∧ q) ∨ (∼p ∧ ∼q)
Using the laws of logic, we have
(p ∧ ∼q) ∨ (∼p ∧ q) ∨ (∼p ∧ ∼q)
≡ (p ∧ ∼q) ∨ [(∼p ∧ q) ∨ (∼p ∧ ∼q)] ...(By Associative Law)
≡ (p ∧ ∼q) ∨ [∼p ∧ (q ∨ ∼q)] ...(By Distributive Law)
≡ (p ∧ ∼q) ∨ (∼p ∧ T) ...(By Complement Law)
≡ (p ∧ ∼q) ∨ ∼p ...(By Identity Law)
≡ (p ∨ ∼p) ∧ (∼q ∨ ∼p) ...(By Distributive Law)
≡ T ∧ (∼q ∨ ∼p) ...(By Complement Law)
≡ ∼q ∨ ∼p ...(By Identity Law)
≡ ∼p ∨ ∼q ...(By Commutative Law)
Hence, the simplified circuit for the given circuit is:
संबंधित प्रश्न
Construct the switching circuit for the following statement : [p v (~ p ∧ q)] v [(- q ∧ r) v ~ p]
Find the symbolic form of the following switching circuit, construct its switching table and interpret it.
Construct the switching circuit for the statement (p ∧ q) ∨ (~ p) ∨ (p ∧ ~ q).
Construct the new switching circuit for the following circuit with only one switch by simplifying the given circuit:
Express the following circuit in the symbolic form of logic and writ the input-output table.
Express the following circuit in the symbolic form of logic and write the input-output table.
Express the following circuit in the symbolic form of logic and write the input-output table.
Express the following circuit in the symbolic form of logic and write the input-output table.
Express the following circuit in the symbolic form of logic and writ the input-output table.
Construct the switching circuit of the following:
(∼ p ∧ q) ∨ (p ∧ ∼ r)
Construct the switching circuit of the following:
(p ∧ q) ∨ [∼ p ∧ (∼ q ∨ p ∨ r)]
Construct the switching circuit of the following:
(p ∧ r) ∨ (∼ q ∧ ∼ r)] ∧ (∼ p ∧ ∼ r)
Construct the switching circuit of the following:
(p ∧ ∼ q ∧ r) ∨ [p ∧ (∼ q ∨ ∼ r)]
Construct the switching circuit of the following:
p ∨ (∼ p) ∨ (∼ q) ∨ (p ∧ q)
Construct the switching circuit of the following:
(p ∧ q) ∨ (∼ p) ∨ (p ∧ ∼ q)
Give an alternative equivalent simple circuit for the following circuit:
Obtain the simple logical expression of the following. Draw the corresponding switching circuit.
[p ∨ ( ∼ q) ∨ (∼ r)] ∧ [p ∨ (q ∧ r)]
Obtain the simple logical expression of the following. Draw the corresponding switching circuit.
(p ∧ q ∧ ∼ p) ∨ (∼ p ∧ q ∧ r) ∨ (p ∧ ∼ q ∧ r) ∨ (p ∧ q ∧ r)
Express the following circuit in the symbolic form. Prepare the switching table:
Simplify the following so that the new circuit has a minimum number of switches. Also, draw the simplified circuit.
Check whether the following switching circuits are logically equivalent - Justify.
(i)
(ii)
Check whether the following switching circuits are logically equivalent - Justify.
(i)
(ii)
Give alternative arrangement of the switching following circuit, has minimum switches.
A stone is dropped into a pond. Waves in the form of circles are generated and radius of outermost ripple increases at the rate of 5 cm/sec. Then area increased after 2 seconds is ______.
Symbolic form of the given switching circuit is equivalent to:
Simplify the given circuit by writing its logical expression. Also, write your conclusion.
Construct the switching circuit for the following logical statement:
(p ∨ ∼ q) ∨ (q ∧ r). Also construct the switching circuit for its simplified form.
Find the alternative arrangement using minimum switches for the following switching circuit.
