adplus-dvertising
frame-decoration

Question

If there are ‘M’ switches in series numbered from 1, 2, …, M. For circuit to be complete and bulb to glow which of the following is necessary?

a.

1∧ 2∧ 3 ∧ … ∧M should be on

b.

1∧ 2∧ 3 ∧ … ∧M should be off

c.

1 v 2 v 3 v … v M should be on

d.

None of the mentioned

Posted under Discrete Mathematics

Answer: (a).1∧ 2∧ 3 ∧ … ∧M should be on

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. If there are ‘M’ switches in series numbered from 1, 2, …, M. For circuit to be complete and bulb to glow which of the following is necessary?

Similar Questions

Discover Related MCQs

Q. If there are ‘M’ switches in parallel numbered from 1, 2, …, M. For circuit to be complete and bulb to glow which of the following is necessary

Q. If in a for it to be complete it is necessary for switch A to be closed and either of switch B or C to be closed, then which can be true?

Q. Which of the following statements is the negation of the statements “4 is odd or -9 is positive”?

Q. Which of the following represents: ~A (negation of A) if A stands for “I like badminton but hate maths”?

Q. The compound statement A v ~(A ∧ B).

Q. Which of the following is De-Morgan’s law?

Q. What is the dual of (A ∧ B) v (C ∧ D)?

Q. ~ A v ~ B is logically equivalent to?

Q. Negation of statement (A ∧ B) → (B ∧ C) is _____________

Q. Which of the following satisfies commutative law?

Q. If the truth value of A v B is true, then truth value of ~A ∧ B can be ___________

Q. If P is always against the testimony of Q, then the compound statement P→(P v ~Q) is a __________

Q. A compound proposition that is always ___________ is called a tautology.

Q. A compound proposition that is always ___________ is called a contradiction.

Q. If A is any statement, then which of the following is a tautology?

Q. If A is any statement, then which of the following is not a contradiction?

Q. A compound proposition that is neither a tautology nor a contradiction is called a ___________

Q. ¬ (A ∨ q) ∧ (A ∧ q) is a ___________

Q. (A ∨ ¬A) ∨ (q ∨ T) is a __________

Q. A ∧ ¬(A ∨ (A ∧ T)) is always __________