UTpaper

Free mock tests & test series

Question 90Asked in BPSC TRE 1.0 (2023) Computer Science Class 11-12

What are the canonical forms of Boolean expressions?

  1. AOR and XOR
  2. BNOR and XNOR
  3. CSOM and POM
  4. DMore than one of the above
  5. ENone of the above
Show answerHide answer

Correct answer: (C) SOM and POM

Explanation

The canonical forms are sum of minterms (SOM, or canonical SOP) and product of maxterms (POM, or canonical POS).

From BPSC TRE 1.0 (2023) Computer Science Class 11-12 — Previous Year Paper

This is question 90 of BPSC TRE 1.0 (2023) 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.