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


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

A. Babylonians
B. G. Cantor
C. George Boole
D. Konrad Zuse

View Answer


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

A. Idempotent Law
B. Complement Law
C. Double Complement Law
D. Identity Law

View Answer


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

A. Commutative Law
B. Dominance Law
C. Associative Law
D. Absorption Law

View Answer


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


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

A. 1952
B. 1950
C. 1956
D. 1953

View Answer


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


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

A. 2
B. 3
C. 4
D. 5

View Answer


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


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





Discussion


* You must be logged in to add comment.