UGC NET - Boolean algebra: Boolean functions, representation and simplification. Online Test (MCQ Quiz)

1. What is the fundamental property of Boolean algebra that states that an expression remains unchanged when its variables are swapped?

A) Distributive Law B) Commutative Law C) Associative Law D) Idempotent Law

2. Which law in Boolean algebra states that A + (A . B) = A?

A) Absorption Law B) De Morgan's Law C) Complement Law D) Identity Law

3. The expression A + 0 equals which of the following?

A) 0 B) 1 C) A D) A'

4. What is the result of A . 1 in Boolean algebra?

A) 0 B) 1 C) A D) A'

5. Which law states that A + A = A?

A) Commutative Law B) Idempotent Law C) Distributive Law D) Associative Law

6. The Boolean expression A . A simplifies to:

A) 0 B) 1 C) A D) A'

7. According to the Complement Law, A + A' equals:

A) 0 B) 1 C) A D) A'

8. What is the result of A . A' in Boolean algebra?

A) 0 B) 1 C) A D) A'

9. Which law states that A + (B + C) = (A + B) + C?

A) Commutative Law B) Distributive Law C) Associative Law D) Idempotent Law

10. The expression A . (B . C) is equivalent to:

A) (A . B) . C B) A + (B . C) C) (A + B) . C D) A + B + C

11. Which law states that A . (B + C) = (A . B) + (A . C)?

A) Commutative Law B) Associative Law C) Distributive Law D) Absorption Law

12. The expression A + (B . C) is equivalent to:

A) (A + B) . (A + C) B) A . B + A . C C) (A . B) + C D) A . (B + C)

13. De Morgan's theorem states that (A + B)' is equivalent to:

A) A' + B' B) A' . B' C) A' . B D) A . B'

14. According to De Morgan's theorem, (A . B)' is equivalent to:

A) A' + B' B) A' . B' C) A' + B D) A + B'

15. What is the dual of the Boolean expression A + (B . C)?

A) A . (B + C) B) (A . B) + C C) A + B + C D) A . B . C

16. The dual of A . (B + C)' is:

A) A + (B . C)' B) (A + B) . C' C) A' + (B . C) D) A + (B' . C')

17. A Boolean function can be represented in Sum of Products (SOP) form. Which of the following is an example of a minterm?

A) A + B B) A' . B C) (A + B') D) A' + B'

18. In a Sum of Products (SOP) expression, each product term contains:

A) all variables in complemented or uncomplemented form B) at least one variable C) only complemented variables D) only uncomplemented variables

19. What is a product term containing all variables in their true or complemented form called?

A) Maxterm B) Minterm C) Sum term D) Literal

20. A Boolean function in Product of Sums (POS) form is a product of:

A) Minterms B) Maxterms C) Sum terms D) Product terms

21. What is a sum term containing all variables in their true or complemented form called?

A) Minterm B) Maxterm C) Product term D) Sum of Products

22. The canonical SOP form of a Boolean function is a sum of:

A) all possible minterms B) selected minterms corresponding to output 1 C) all possible maxterms D) selected maxterms corresponding to output 0

23. The canonical POS form of a Boolean function is a product of:

A) all possible minterms B) selected minterms corresponding to output 1 C) all possible maxterms D) selected maxterms corresponding to output 0

24. A Karnaugh map (K-map) is a graphical method used for:

A) generating Boolean expressions B) simplifying Boolean expressions C) evaluating Boolean functions D) converting between SOP and POS forms

25. For a Boolean function with 'n' variables, a K-map typically has how many cells?

A) n B) 2n C) n^2 D) 2^n

26. In a K-map, adjacent cells (horizontally or vertically) differ by how many bits?

A) 0 B) 1 C) 2 D) n

27. When simplifying a Boolean expression using a K-map, groups of 1s are formed. The size of each group must be a power of:

A) 1 B) 2 C) 4 D) 8

28. What is the primary goal of using Boolean algebra in digital logic design?

A) To increase the number of gates B) To reduce the complexity of the circuit C) To introduce delays D) To generate random outputs

29. The expression F = AB + A'B simplifies to:

A) A B) B C) A' D) B'

30. Simplify the Boolean expression: F = A(A+B).

A) A B) B C) A+B D) AB

31. If F = (A+B)(A'+B), what is the simplified expression?

A) A B) B C) A' D) B'

32. Which simplification rule is applied to (A+B) + (A+B)' = 1?

A) Commutative Law B) Idempotent Law C) Complement Law D) Distributive Law

33. Consider the expression F = AB' + A'B. This is the definition of:

A) AND operation B) OR operation C) XOR operation D) XNOR operation

34. The expression F = AB + A'B' represents:

A) XOR B) XNOR C) AND D) OR

35. What is the Boolean function for a 2-input multiplexer's output Y, given inputs A, B, and Select S?

A) Y = A'B + AS B) Y = A S + B S' C) Y = A S' + B S D) Y = A'S + B'S'

36. How many variables are needed to represent a Boolean function with 8 minterms?

A) 2 B) 3 C) 4 D) 8

37. Which of the following is NOT a standard Boolean algebra postulate?

A) Commutative Law B) Associative Law C) Transitive Law D) Distributive Law

38. The expression F = (A+B)(A'+B') simplifies to:

A) A B) B C) A' D) B'

39. What is the Quine-McCluskey method primarily used for?

A) Circuit design B) Boolean function simplification C) Boolean function minimization D) Both B and C

40. Which representation is often used for Boolean functions in computer science, especially in logic programming?

A) Truth Table B) Boolean Expression C) Karnaugh Map D) Venn Diagram

41. The Boolean expression (AB)' + (A+B)' simplifies to:

A) A' B) B' C) A'+B' D) A'.B'

42. What is the result of applying the consensus theorem: XY + X'Z + YZ = XY + X'Z?

A) True B) False C) Depends on the variables D) Cannot be determined

43. The expression F = A + A'B simplifies to:

A) A+B B) A C) B D) A'

44. Which of the following is a canonical form of Boolean algebra?

A) Algebraic form B) Tabular form C) Sum of Products (SOP) D) Product of Sums (POS)

45. If a Boolean function has 3 variables, how many maxterms are possible?

A) 3 B) 4 C) 8 D) 9

46. What is the Boolean expression for the NOR gate?

A) A + B B) (A + B)' C) A . B D) (A . B)'

47. The expression F = (A' + B)(A + B') simplifies to:

A) A XOR B B) A XNOR B C) A AND B D) A OR B

48. What does the Boolean expression A + B + C represent?

A) AND operation B) OR operation C) NAND operation D) NOR operation

49. Which method is used to systematically derive a minimal sum-of-products expression from a truth table?

A) Boolean algebra manipulation B) Karnaugh maps C) Quine-McCluskey algorithm D) All of the above

50. The expression A . (A' + B) simplifies to:

A) A . B B) A + B C) A' D) B

Boolean algebra: Boolean functions, representation and simplification. - Online Test

Test Results