HSC Science (General) १२ वीं कक्षा - Maharashtra State Board Question Bank Solutions for Mathematics and Statistics

Rewrite the following statement without using if ...... then.

It f(2) = 0 then f(x) is divisible by (x – 2).

Without using truth table prove that:

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

Without using truth table prove that:

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

Without using truth table prove that:

∼ [(p ∨ ∼ q) → (p ∧ ∼ q)] ≡ (p ∨ ∼ q) ∧ (∼ p ∨ q)

Using rules in logic, prove the following:

p ↔ q ≡ ∼(p ∧ ∼q) ∧ ∼(q ∧ ∼p)

Using rules in logic, prove the following:

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

Using rules in logic, prove the following:

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

Using the rules in logic, write the negation of the following:

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

Using the rules in logic, write the negation of the following:

p ∧ (q ∨ r)

Using the rules in logic, write the negation of the following:

(p → q) ∧ r

Using the rules in logic, write the negation of the following:

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

Without using truth table prove that (p ∧ q) ∨ (∼ p ∧ q) v (p∧ ∼ q) ≡ p ∨ q

Without using truth table, prove that : [(p ∨ q) ∧ ∼p] →q is a tautology.

The simplified form of [(~ p v q) ∧ r] v [(p ∧ ~ q) ∧ r] is ______.

Without using truth table prove that

[(p ∧ q ∧ ∼ p) ∨ (∼ p ∧ q ∧ r) ∨ (p ∧ q ∧ r) ∨ (p ∧ ∼ q ∧ r) ≡ (p ∨ q) ∧ r

The statement p → (q → p) is equivalent to ______.

Show that the simplified form of (p ∧ q ∧ ∼ r) ∨ (r ∧ p ∧ q) ∨ (∼ p ∨ q) is q ∨ ∼ p.

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.