# Discrete Mathematics Questions and Answers – Boolean Algebra

This section focuses on "Boolean Algebra" in Discrete Mathematics. These Multiple Choice Questions (mcq) should be practiced to improve the Discrete Mathematics skills required for various interviews (campus interviews, walk-in interviews, company interviews), placements, entrance exams and other competitive examinations.

1. Boolean algebra deals with variables that can have?

A. two discrete values

B. three discrete values

C. four discrete values

D. five discrete values

View Answer

Ans : A

Explanation: Boolean algebra is algebra of logic. It deals with variables that can have two discrete values, 0 (False) and 1 (True)

2. The earliest method of manipulating symbolic logic was invented by?

A. Babylonians

B. G. Cantor

C. George Boole

D. Konrad Zuse

View Answer

Ans : C

Explanation: The earliest method of manipulating symbolic logic was invented by George Boole and subsequently came to be known as Boolean Algebra.

3. Which Boolean Identities law proof A+A=A ?

A. Idempotent Law

B. Complement Law

C. Double Complement Law

D. Identity Law

View Answer

Ans : A

Explanation: Idempotent Law : A+A=A (OR Form) and A.A=A (AND Form)

4. Which Boolean Identities law proof A+1=1?

A. Commutative Law

B. Dominance Law

C. Associative Law

D. Absorption Law

View Answer

Ans : B

Explanation: Dominance Law : A+1=1 (OR Form) and A.0=0 (AND Form)

5. A _____________ is a product of all variables taken either in their direct or complemented form.

A. minterm

B. maxterm

C. variables

D. None of the above

View Answer

Ans : A

Explanation: Sum of Minterms: A minterm is a product of all variables taken either in their direct or complemented form. Any Boolean function can be expressed as a sum of its 1-minterms and the inverse of the function can be expressed as a sum of its 0-minterms.

6. The Karnaugh map (K–map), introduced by Maurice Karnaughin in?

A. 1952

B. 1950

C. 1956

D. 1953

View Answer

Ans : D

Explanation: The Karnaugh map (K–map), introduced by Maurice Karnaughin in 1953.

7. The logic gate which gives high output for the same inputs, otherwise low output is known a?

A. NOT

B. X-NOR

C. AND

D. XOR

View Answer

Ans : B

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

8. How many type of canonical forms for a Boolean expression?

A. 2

B. 3

C. 4

D. 5

View Answer

Ans : A

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

9. F(X,Y,Z,M) = X`Y`Z`M`. The degree of the function is ________

A. 2

B. 3

C. 4

D. 5

View Answer

Ans : C

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

10. Boolean algebra can be used ____________

A. For designing of the digital computers

B. In building logic symbols

C. Circuit theory

D. Building algebraic functions

View Answer

Ans : A

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

Discussion