adplus-dvertising
frame-decoration

Question

What are the canonical forms of Boolean Expressions?

a.

OR and XOR

b.

NOR and XNOR

c.

MAX and MIN

d.

SOM and POM

Answer: (d).SOM and POM

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What are the canonical forms of Boolean Expressions?

Similar Questions

Discover Related MCQs

Q. Which of the following is/are the universal logic gates?

Q. The logic gate that provides high output for same inputs ____________

Q. The ___________ of all the variables in direct or complemented from is a maxterm.

Q. What is the use of Boolean identities?

Q. _________ is used to implement the Boolean functions.

Q. Inversion of single bit input to a single bit output using _________

Q. There are _________ numbers of Boolean functions of degree n.

Q. A _________ is a Boolean variable.

Q. Minimization of function F(A,B,C) = A*B*(B+C) is _________

Q. The set for which the Boolean function is functionally complete is __________

Q. (X+Y`)(X+Z) can be represented by _____

Q. __________ is a disjunctive normal form.

Q. a ⊕ b = ________

Q. Find the simplified expression A’BC’+AC’.

Q. Evaluate the expression: (X + Z)(X + XZ’) + XY + Y.

Q. Simplify the expression: A’(A + BC) + (AC + B’C).

Q. What is the simplification value of MN(M + N’) + M(N + N’)?

Q. Simplify the expression XZ’ + (Y + Y’Z) + XY.

Q. Find the simplified term Y’ (X’ + Y’) (X + X’Y)?

Q. If an expression is given that x+x’y’z=x+y’z, find the minimal expression of the function F(x,y,z) = x+x’y’z+yz?