Skip to content
Long Answer Questions · Q22

Q.Write the Boolean expression for

(i) OR gate,
(ii) AND gate, and
(iii) NAND Gate.
Maharashtra MsbshseTextbookSubjectiveImportance★★★★★
22% · 12/54 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

(i) OR gate: the output Y is 1 (high) whenever any one, or more than one, of the inputs is 1 -- for two inputs A and B, this is written Y=A+BY=A+B, where '+' denotes the logical OR operation (not ordinary addition; note 1+1=11+1=1 in Boolean algebra). (ii) AND gate: the output Y is 1 (high) only when ALL inputs are simultaneously 1 -- for two inputs, Y=A⋅BY=A\cdot B, where '⋅\cdot' denotes the logical AND operation, directly analogous to ordinary multiplication of 0s and 1s. (iii) NAND gate: formed by an AND gate followed by a NOT gate (inversion), so its output is the exact complement of the AND gate's output -- Y=A⋅B‾Y=\overline{A\cdot B}, where the overline over the whole product denotes that the ENTIRE AND result is negated (this is different from negating A and B individually before ANDing them, which would give a …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.