English

Simplify the following circuit so that the new circuit has minimum number of switches. Also, draw the simplified circuit. - Mathematics and Statistics

Advertisements
Advertisements

Question

Simplify the following circuit so that the new circuit has minimum number of switches. Also, draw the simplified circuit.

Simplify

Solution

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 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:

shaalaa.com
  Is there an error in this question or solution?
Chapter 1: Mathematical Logic - Miscellaneous Exercise 1 [Page 34]

APPEARS IN

RELATED QUESTIONS

Construct the switching circuit for the following statement : [p v (~ p ∧ q)] v [(- q ∧ r) v ~ p]


Construct the simplified circuit for the following circuit:


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).


Find the symbolic form of the given switching circuit. Construct its switching table and interpret your result.


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.


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:


Give an alternative equivalent simple circuit for the following circuit:


Write the symbolic form of the following switching circuit construct its switching table and interpret it.


Write the symbolic form of the following switching circuit construct its switching table and interpret it.


Obtain the simple logical expression of the following. Draw the corresponding switching circuit.

(∼ p ∧ q) ∨ (∼ p ∧ ∼ q) ∨ (p ∧ ∼ q)


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.


Simplify the following so that the new circuit.


Represent the following switching circuit in symbolic form and construct its switching table. Write your conclusion from the switching table.



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.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×