Test: Boolean Algebra - Computer Science Engineering (CSE) MCQ

The Boolean function is expressed as a sum of the 1-minterms and the inverse of function is represented as 0-minterms.

The logic gate which gives high output for the same inputs, otherwise low output is known as X-NOR or Exclusive NOR gate.

There are two kinds of canonical forms for a Boolean expression-> 1)sum of minterms(SOM) form and 2)product of maxterms(SOM) form.

A Boolean value is given by a Boolean expression which is formed by combining Boolean variables and logical connectives.

A Boolean function is a special mathematical function with n degrees and where Y = {0,1} is the Boolean domain with being a non-negative integer. It helps in describing the way in which the Boolean output is derived from Boolean inputs.

The variables that can have two discrete values False(0) and True(1) and the operations of logical significance are dealt with Boolean algebra.

NAND and NOR gates are known as the universal logic gates. A universal gate is a gate which can implement any Boolean function without the help of 3 basic gate types.

By Simplification Law we can have X.(~X+Y) = X.Y and X+(~X.Y) = X+Y. By, De’ Morgan’s law ~(X+Y) = ~X.~Y. By commutative law we can say that A.(B.C) = (A.B).C.

This is a function of degree 4 from the set of ordered pairs of Boolean variables to the set {0,1}.

For designing digital computers and building different electronic circuits boolean algebra is accepted widely.