Boolean Algebra - Boolean logic, Boolean operations, operator precedence, laws of Boolean algebra, representation of Boolean functions, simplification methods - One Line Questions

1. What is the dual of the Boolean expression F = (A + B) · C? — (A · B) + C
2. What is the symbol for the Boolean AND operation? — · (dot) or omission
3. According to De Morgan's Law, ¬(A · B) is equivalent to: — ¬A + ¬B
4. De Morgan's Law for the OR operation states that ¬(A + B) is equivalent to: — ¬A · ¬B
5. Using De Morgan's Law, ¬(X Y) simplifies to: — ¬X + ¬Y
6. What is the result of A + 0 in Boolean algebra? — A
7. According to the identity law, A · 1 is equal to: — A
8. What is the result of A + ¬A in Boolean algebra? — 1
9. The complement law states that A · ¬A is equal to: — 0
10. What is the Boolean value of 'True'? — 1
11. What is the Boolean value of 'False'? — 0
12. How many unique Boolean functions of a single variable exist? — 2
13. How many unique Boolean functions of two variables (A, B) exist? — 16
14. Consider the Boolean expression F = A + AB. Using the absorption law, what is the simplified form? — A
15. If F = A · (A + B), what is the simplified form using absorption law? — A
16. What is the simplified form of A · B + A · ¬B? — A
17. Simplify the expression: (A + B) · (A + ¬B) — A
18. What is the simplified form of A + AB + A'B? — A
19. The idempotent law for the OR operation is: — A + A = A
20. The distributive law in Boolean algebra states that A · (B + C) is equal to: — A · B + A · C
21. According to the commutative law of Boolean algebra, which statement is true? — A + B = B + A
22. In a Sum of Products (SOP) form, the function is expressed as: — A sum of products
23. What does a 'minterm' represent in Boolean algebra? — A product term that is true for only one specific combination of input variables
24. A 'maxterm' in Boolean algebra is: — A sum term that is false for only one specific combination of input variables
25. What is the consensus term of AB and ¬BC? — AC
26. Which of the following is NOT a basic Boolean operation? — XOR
27. The expression F = A'B + AB' + A'B' represents which logical operation? — XOR
28. In Boolean algebra, what does the '+' symbol typically represent? — OR operation
29. Which law is used to simplify A + (¬A · B) to A + B? — Distributive Law
30. Which simplification method is generally considered more systematic for a larger number of variables compared to K-maps? — Quine-McCluskey Algorithm
31. Which simplification method uses a graphical representation with cells representing minterms or maxterms? — Karnaugh Map (K-map)
32. Which law states that A + (B + C) = (A + B) + C? — Associative Law
33. Which law states that A + A = A? — Idempotent Law
34. The absorption law A · (A + B) = A is an example of: — Absorption
35. Which law states that A + (A · B) = A? — Absorption Law
36. The Quine-McCluskey algorithm is a tabular method used for: — Simplifying Boolean functions algorithmically
37. Which law states that A · A = A? — Idempotent Law
38. The NOT operation in Boolean algebra is also known as: — Inversion
39. What is the primary method for representing Boolean functions with a small number of variables? — Truth Tables
40. The canonical SOP form of a Boolean function is obtained by summing all its: — Minterms
41. The canonical POS form of a Boolean function is obtained by multiplying all its: — Maxterms
42. For a Boolean function with 'n' variables, how many rows are typically present in its truth table? — 2^n
43. What is the standard operator precedence in Boolean algebra? — NOT, AND, OR
44. What is the fundamental basis of Boolean algebra? — Logical values (True/False)
45. What is the goal of simplifying a Boolean function? — To minimize the complexity of the resulting logic circuit
46. A truth table lists all possible combinations of input values and the corresponding output for a given Boolean function. — True
47. A Boolean function can be represented as a sum of products (SOP) or a product of sums (POS). — True
48. The dual of a Boolean expression is obtained by interchanging AND and OR operations, and 0 and 1. — True
49. A Boolean expression representing a logic gate's functionality is known as its: — Boolean Function
50. Karnaugh maps are most effective for simplifying Boolean functions with how many variables? — Up to 4 or 5
All One Line Questions
E-Book Boolean Algebra - Boolean logic, Boolean operations, operator precedence, laws of Boolean algebra, representation of Boolean functions, simplification methods Online Test Boolean Algebra - Boolean logic, Boolean operations, operator precedence, laws of Boolean algebra, representation of Boolean functions, simplification methods Question Bank Boolean Algebra - Boolean logic, Boolean operations, operator precedence, laws of Boolean algebra, representation of Boolean functions, simplification methods