Advertisements
Advertisements
The simplified form of [(~ p v q) ∧ r] v [(p ∧ ~ q) ∧ r] is ______.
Concept: undefined >> undefined
Without using truth table prove that
[(p ∧ q ∧ ∼ p) ∨ (∼ p ∧ q ∧ r) ∨ (p ∧ q ∧ r) ∨ (p ∧ ∼ q ∧ r) ≡ (p ∨ q) ∧ r
Concept: undefined >> undefined
Advertisements
The statement p → (q → p) is equivalent to ______.
Concept: undefined >> undefined
Show that the simplified form of (p ∧ q ∧ ∼ r) ∨ (r ∧ p ∧ q) ∨ (∼ p ∨ q) is q ∨ ∼ p.
Concept: undefined >> undefined
Construct the switching circuit for the following statement : [p v (~ p ∧ q)] v [(- q ∧ r) v ~ p]
Concept: undefined >> undefined
Construct the simplified circuit for the following circuit:

Concept: undefined >> undefined
Find the symbolic form of the following switching circuit, construct its switching table and interpret it.

Concept: undefined >> undefined
Construct the switching circuit for the statement (p ∧ q) ∨ (~ p) ∨ (p ∧ ~ q).
Concept: undefined >> undefined
Simplify the following circuit so that the new circuit has minimum number of switches. Also, draw the simplified circuit.

Concept: undefined >> undefined
Construct the new switching circuit for the following circuit with only one switch by simplifying the given circuit:

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

Concept: undefined >> undefined
Express the following circuit in the symbolic form of logic and writ the input-output table.

Concept: undefined >> undefined
Express the following circuit in the symbolic form of logic and write the input-output table.

Concept: undefined >> undefined
Express the following circuit in the symbolic form of logic and write the input-output table.

Concept: undefined >> undefined
Express the following circuit in the symbolic form of logic and write the input-output table.

Concept: undefined >> undefined
Express the following circuit in the symbolic form of logic and writ the input-output table.

Concept: undefined >> undefined
Express the following circuit in the symbolic form of logic and writ the input-output table.

Concept: undefined >> undefined
Construct the switching circuit of the following:
(∼ p ∧ q) ∨ (p ∧ ∼ r)
Concept: undefined >> undefined
Construct the switching circuit of the following:
(p ∧ q) ∨ [∼ p ∧ (∼ q ∨ p ∨ r)]
Concept: undefined >> undefined
Construct the switching circuit of the following:
(p ∧ r) ∨ (∼ q ∧ ∼ r)] ∧ (∼ p ∧ ∼ r)
Concept: undefined >> undefined
