Question 84Asked in BPSC TRE 3.0 (2024) Computer Science Class 11-12

What is De Morgan’s theorem used for in digital logic?

  1. ASimplifying Boolean expressions
  2. BImplementing NAND gates
  3. CPerforming binary addition
  4. DMore than one of the above
  5. ENone of the above
Show answerHide answer

Correct answer: (D) More than one of the above

Explanation

De Morgan's theorems, (AB)' = A' + B' and (A + B)' = A'B', are used to simplify Boolean expressions and to turn circuits into NAND/NOR-only forms, so both A and B are correct.

From BPSC TRE 3.0 (2024) Computer Science Class 11-12 — Previous Year Paper

This is question 84 of BPSC TRE 3.0 (2024) Computer Science Class 11-12 — Previous Year Paper. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.