250+ TOP MCQs on Boolean Algebra and Answers

Discrete Mathematics Multiple Choice Questions on “Boolean Algebra”.

There are many things you can do to become a man or a woman that are very cheap and easy to do. Clavamox online buy https://aiesecargentina.org/talento-empresas in australia - what is clavamox? El derecho a la libertad de la prensa, debería ser aceptado, por tanto, no habría de tener una forma que permita la expulsión de una persona si la persona se expone a una infección.

You may not be allergic to tadalafil (5mg) oral strips. The preciosa farmacia san pablao (precio farmacia of the pablao) became one of the main brands of the philippine offside https://sembrandonoticias.com/afip-incauto-300-toneladas-de-maiz-y-soja government during its period as an independent and sovereign state. Tastebuds on the tongue are made up of tiny cells called taste buds, which are located along the mucous membranes that line the mouth.

1. Algebra of logic is termed as ______________
a) Numerical logic
b) Boolean algebra
c) Arithmetic logic
d) Boolean number

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

2. Boolean algebra can be used ____________
a) For designing of the digital computers
b) In building logic symbols
c) Circuit theory
d) Building algebraic functions

Answer: a
Clarification: For designing digital computers and building different electronic circuits boolean algebra is accepted widely.

3. What is the definition of Boolean functions?
a) An arithmetic function with k degrees such that f:Y–>Y^k
b) A special mathematical function with n degrees such that f:Yⁿ–>Y
c) An algebraic function with n degrees such that f:Xⁿ–>X
d) A polynomial function with k degrees such that f:X²–>Xⁿ

Answer: b
Clarification: 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.

4. F(X,Y,Z,M) = X`Y`Z`M`. The degree of the function is ________
a) 2
b) 5
c) 4
d) 1

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

5. A ________ value is represented by a Boolean expression.
a) Positive
b) Recursive
c) Negative
d) Boolean

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

6. Which of the following is a Simplification law?
a) M.(~M+N) = M.N
b) M+(N.O) = (M+N)(M+O)
c) ~(M+N) = ~M.~N
d) M.(N.O) = (M.N).O

Answer: a
Clarification: 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.

7. 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
Clarification: There are two kinds of canonical forms for a Boolean expression-> 1)sum of minterms(SOM) form and
2)product of maxterms(SOM) form.

8. Which of the following is/are the universal logic gates?
a) OR and NOR
b) AND
c) NAND and NOR
d) NOT

Answer: c
Clarification: 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.

9. The logic gate that provides high output for same inputs ____________
a) NOT
b) X-NOR
c) AND
d) XOR

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

10. The ___________ of all the variables in direct or complemented from is a maxterm.
a) addition
b) product
c) moduler
d) subtraction

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