TRB PG Assistant - Boolean Algebra - Boolean logic, Boolean operations, operator precedence, laws of Boolean algebra, representation of Boolean functions, simplification methods Question Bank with Options

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

A) Commutative Law

B) Associative Law

C) Idempotent Law

D) Distributive Law

2. What is the simplified form of A + AB + A'B?

A) A

B) B

C) A+B

D) 1

3. The expression F = A'B + AB' + A'B' represents which logical operation?

A) AND

B) OR

C) XOR

D) XNOR

4. Which simplification method is generally considered more systematic for a larger number of variables compared to K-maps?

A) Boolean Algebra

B) Karnaugh Map

C) Quine-McCluskey Algorithm

D) Venn Diagrams

5. A Boolean expression representing a logic gate's functionality is known as its:

A) Truth Table

B) Boolean Function

C) Karnaugh Map

D) State Diagram

6. How many unique Boolean functions of two variables (A, B) exist?

A) 4

B) 8

C) 16

D) 32

7. How many unique Boolean functions of a single variable exist?

A) 1

B) 2

C) 3

D) 4

8. The consensus theorem states that X Y + ¬X Z + Y Z = X Y + ¬X Z. What is the consensus term?

A) X Y

B) ¬X Z

C) Y Z

D) X Z

9. What is the consensus term of AB and ¬BC?

A) AC

B) A¬C

C) ¬AC

D) BC

10. Which law is used to simplify A + (¬A · B) to A + B?

A) Associative Law

B) Distributive Law

C) Absorption Law

D) Consensus Theorem

11. What is the Boolean value of 'False'?

A) 0

B) 1

C) True

D) Undefined

12. What is the Boolean value of 'True'?

A) 0

B) 1

C) A

D) False

13. The dual of a Boolean expression is obtained by interchanging AND and OR operations, and 0 and 1.

A) True

B) False

C) Only interchanging AND and OR

D) Only interchanging 0 and 1

14. What is the dual of the Boolean expression F = (A + B) · C?

A) (A · B) + C

B) (A + B) + C

C) (A · B) · C

D) A + B + C

15. Using De Morgan's Law, ¬(X Y) simplifies to:

A) ¬X Y

B) X ¬Y

C) ¬X + ¬Y

D) ¬X · ¬Y

16. Simplify the expression: (A + B) · (A + ¬B)

A) A

B) B

C) A + B

D) A · B

17. What is the simplified form of A · B + A · ¬B?

A) A

B) B

C) A + B

D) A · B

18. If F = A · (A + B), what is the simplified form using absorption law?

A) A

B) B

C) AB

D) A + B

19. Consider the Boolean expression F = A + AB. Using the absorption law, what is the simplified form?

A) A

B) B

C) AB

D) A + B

20. The canonical POS form of a Boolean function is obtained by multiplying all its:

A) Maxterms

B) Minterms

C) Product terms

D) Sum terms

21. The canonical SOP form of a Boolean function is obtained by summing all its:

A) Maxterms

B) Minterms

C) Product terms

D) Sum terms

22. A 'maxterm' in Boolean algebra is:

A) A product term that is true for only one specific combination of input variables

B) A sum term that is false for only one specific combination of input variables

C) A simplified Boolean expression

D) A Boolean operator

23. What does a 'minterm' represent in Boolean algebra?

A) A product term that is true for only one specific combination of input variables

B) A sum term that is true for all combinations of input variables

C) A simplified Boolean expression

D) A Boolean operator

24. The Quine-McCluskey algorithm is a tabular method used for:

A) Generating truth tables

B) Representing Boolean functions graphically

C) Simplifying Boolean functions algorithmically

D) Performing Boolean operations

25. What is the goal of simplifying a Boolean function?

A) To increase the number of terms

B) To reduce the number of variables

C) To minimize the complexity of the resulting logic circuit

D) To make the truth table larger

26. Karnaugh maps are most effective for simplifying Boolean functions with how many variables?

A) Up to 2

B) Up to 3

C) Up to 4 or 5

D) Any number

27. Which simplification method uses a graphical representation with cells representing minterms or maxterms?

A) Boolean Algebra laws

B) Truth Table reduction

C) Karnaugh Map (K-map)

D) Quine-McCluskey algorithm

28. In a Sum of Products (SOP) form, the function is expressed as:

A) A product of sums

B) A sum of products

C) A single product term

D) A single sum term

29. A Boolean function can be represented as a sum of products (SOP) or a product of sums (POS).

A) True

B) False

C) Only SOP is possible

D) Only POS is possible

30. For a Boolean function with 'n' variables, how many rows are typically present in its truth table?

A) n

B) 2n

C) n^2

D) 2^n

31. A truth table lists all possible combinations of input values and the corresponding output for a given Boolean function.

A) True

B) False

C) Depends on the function

D) Only for AND/OR operations

32. What is the primary method for representing Boolean functions with a small number of variables?

A) Karnaugh Maps

B) Truth Tables

C) Boolean Expressions

D) Venn Diagrams

33. According to De Morgan's Law, ¬(A · B) is equivalent to:

A) ¬A · ¬B

B) ¬A + ¬B

C) A + ¬B

D) ¬A + B

34. De Morgan's Law for the OR operation states that ¬(A + B) is equivalent to:

A) ¬A + ¬B

B) ¬A · ¬B

C) A + ¬B

D) ¬A + B

35. The absorption law A · (A + B) = A is an example of:

A) Commutativity

B) Absorption

C) Idempotence

D) Complementation

36. Which law states that A + (A · B) = A?

A) Distributive Law

B) Absorption Law

C) Associative Law

D) Identity Law

37. The complement law states that A · ¬A is equal to:

A) 0

B) 1

C) A

D) ¬A

38. What is the result of A + ¬A in Boolean algebra?

A) 0

B) 1

C) A

D) ¬A

39. Which law states that A · A = A?

A) Idempotent Law

B) Complement Law

C) Absorption Law

D) De Morgan's Law

40. The idempotent law for the OR operation is:

A) A + A = A

B) A + 0 = A

C) A + 1 = 1

D) A + ¬A = 1

41. According to the identity law, A · 1 is equal to:

A) 0

B) 1

C) A

D) ¬A

42. What is the result of A + 0 in Boolean algebra?

A) 0

B) 1

C) A

D) ¬A

43. The distributive law in Boolean algebra states that A · (B + C) is equal to:

A) A + B · A + C

B) A · B + A · C

C) (A + B) · (A + C)

D) A + B + C

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

A) Commutative Law

B) Associative Law

C) Distributive Law

D) Identity Law

45. According to the commutative law of Boolean algebra, which statement is true?

A) A + B = B + A

B) A · B = A + B

C) A + A = A

D) A · (B + C) = A · B + C

46. What is the standard operator precedence in Boolean algebra?

A) OR, AND, NOT

B) AND, OR, NOT

C) NOT, AND, OR

D) NOT, OR, AND

47. The NOT operation in Boolean algebra is also known as:

A) Inversion

B) Conjunction

C) Disjunction

D) Equivalence

48. What is the symbol for the Boolean AND operation?

A) +

B) · (dot) or omission

C) ¬

D) ⊕

49. In Boolean algebra, what does the '+' symbol typically represent?

A) AND operation

B) OR operation

C) NOT operation

D) XOR operation

50. Which of the following is NOT a basic Boolean operation?

A) AND

B) OR

C) NOT

D) XOR

Boolean Algebra - Boolean logic, Boolean operations, operator precedence, laws of Boolean algebra, representation of Boolean functions, simplification methods - Question Bank