Scribd
Upload
8 views

Boolean Algebra Questions and Answers - Sanfoundry

The document contains a set of multiple choice questions and answers focused on Boolean Algebra, covering topics such as definitions, laws, and functions. Key concepts include the use of Boolean algebra in digital computer design and the identification of universal logic gates. The document serves as a resource for practicing discrete mathematics with an emphasis on Boolean expressions and simplification laws.

Uploaded by

Oasis Tech
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

Boolean Algebra Questions and Answers - Sanfoundry

The document contains a set of multiple choice questions and answers focused on Boolean Algebra, covering topics such as definitions, laws, and functions. Key concepts include the use of Boolean algebra in digital computer design and the identification of universal logic gates. The document serves as a resource for practicing discrete mathematics with an emphasis on Boolean expressions and simplification laws.

Uploaded by

Oasis Tech
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Discrete Mathematics Questions and

Answers – Boolean Algebra


This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Boolean Algebra”.

1. Algebra of logic is termed as ______________


a) Numerical logic
b) Boolean algebra
c) Arithmetic logic
d) Boolean number

View Answer

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

ADVERTISEMENT

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

View Answer

Answer: a
Explanation: For designing digital computers and building di!erent 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–>Yk
b) A special mathematical function with n degrees such that f:Yn–>Y
c) An algebraic function with n degrees such that f:Xn–>X
d) A polynomial function with k degrees such that f:X2–>Xn

View Answer

Answer: b
Explanation: 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

View Answer

Answer: c
Explanation: 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
:
View Answer

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

Subscribe Now: Discrete Mathematics Newsletter | Important Subjects Newsletters

ADVERTISEMENT

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

View Answer

Answer: a
Explanation: 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

View Answer

Answer: d
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.

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


a) OR and NOR
b) AND
c) NAND and NOR
d) NOT

View Answer

Answer: c
Explanation: 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

View Answer

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

View Answer

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

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple
Choice Questions and Answers.

« Prev - Discrete Mathematics Questions » Next - Discrete Mathematics Questions and


and Answers – Spanning Trees Answers – Boolean Functions

Related Posts:

Check BCA Books

Practice Computer Science MCQs

Check Computer Science Books

Apply for BCA Internship

Practice Information Technology MCQs

advertisement
ADVERTISEMENT
:
Recommended Articles:
1. Discrete Mathematics Questions and Answers – Boolean Algebra – Prime Implicants
and Essentials

2. Discrete Mathematics Questions and Answers – Boolean Algebra – Karnaugh Maps

3. Discrete Mathematics Questions and Answers – Boolean Algebra – Interconversion


of Gates

4. Discrete Mathematics Questions and Answers – Boolean Functions

5. Discrete Mathematics Questions and Answers – Minimization of Boolean Functions

6. Boolean Algebra

7. Discrete Mathematics Certification

8. Discrete Mathematics Questions and Answers – Discrete Probability – Generating


Functions

9. Switching Circuits Questions and Answers – Boolean Algebra Simplification


Theorems

10. Discrete Mathematics MCQ (Multiple Choice Questions)

advertisement
ADVERTISEMENT
:
Additional Resources:

Discrete Mathematics MCQ Questions

Mathematics Department MCQ Questions

Engineering Mathematics MCQ Questions

Signals and Systems MCQ Questions

Computer Science MCQ Questions

Popular Pages:

Digital Circuits MCQ Questions

MCA Questions and Answers

Probability MCQ Questions

Electrical Engineering MCQ Questions

Probability and Statistics MCQ Questions


:
Subscribe: Discrete Mathematics
Newsletter

Name

Email

Subscribe

Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification


contest to get free Certificate of Merit. Join our social networks below and stay updated
with latest contests, videos, internships and jobs!

Youtube | Telegram | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Manish Bhojasia, a technology veteran with 20+ years @ Cisco &


Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore,
and focuses on development of Linux Kernel, SAN Technologies,
Advanced C, Data Structures & Alogrithms. Stay connected with him
at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at


Telegram SanfoundryClasses.

.
About | Certifications | Internships | Jobs | Privacy Policy | Terms | Copyright | Contact

     

© 2011-2025 Sanfoundry. All Rights Reserved.


:

You might also like