1. : What is the primary purpose of Karnaugh Maps in Boolean algebra?
(A) Addition of binary numbers
(B) Simplification of Boolean expressions
(C) Converting decimal to binary
(D) Designing software algorithms
2. : How many cells does a 3-variable Karnaugh Map contain?
(A) 4
(B) 6
(C) 8
(D) 16
3. : In a 4-variable K-Map, how many minterms are there?
(A) 8
(B) 12
(C) 16
(D) 32
4. : What is the maximum number of adjacent 1s that can be grouped together in a K-Map for simplification?
(A) 2
(B) 4
(C) 8
(D) Any power of 2
5. : What does each cell in a K-Map represent?
(A) A logic gate
(B) A binary number
(C) A minterm
(D) A truth table row
6. : Which of the following is a valid group in a 4-variable K-Map?
(A) 3 adjacent 1s
(B) 5 adjacent 1s
(C) 4 adjacent 1s
(D) 7 adjacent 1s
7. : What shape should groupings in a K-Map form?
(A) Rectangular
(B) Circular
(C) Triangular
(D) Diagonal
8. : What kind of adjacency is used in K-Maps?
(A) Binary adjacency
(B) Decimal adjacency
(C) Gray code adjacency
(D) Logical adjacency
9. : In a 2-variable K-Map, how many groups of 2 adjacent 1s can be formed at most?
(A) 1
(B) 2
(C) 3
(D) 4
10. : Which of the following is NOT a rule for grouping in a K-Map?
(A) Groups must contain 1s only
(B) Groups must be power of two
(C) Groups can be diagonal
(D) Groups can wrap around
11. : The Quine-McCluskey method is also known as what?
(A) Truth table method
(B) Tabulation method
(C) Karnaugh method
(D) DeMorgan’s method
12. : What is the first step in the Quine-McCluskey method?
(A) Combine maxterms
(B) Eliminate variables
(C) Group minterms by number of 1s
(D) Apply DeMorgan’s theorem
13. : What is a prime implicant in the Quine-McCluskey method?
(A) A single term
(B) A simplified Boolean expression
(C) An essential part of the final solution
(D) A term that cannot be combined further
14. : What is an essential prime implicant?
(A) One that is always true
(B) Covers minterms not covered by others
(C) The last term in simplification
(D) A common term between groups
15. : What is the output of the Quine-McCluskey method?
(A) A truth table
(B) A simplified Boolean expression
(C) A truth value
(D) A K-Map
16. : What technique is used to minimize expressions in the Quine-McCluskey method?
(A) Elimination
(B) Implicant chart
(C) Logical negation
(D) Boolean multiplication
17. : Which of these is not a valid step in the Quine-McCluskey method?
(A) Grouping minterms
(B) Pairing adjacent terms
(C) Using DeMorgan’s laws
(D) Finding essential prime implicants
18. : What is the minimum group size in Quine-McCluskey pairing?
(A) 1
(B) 2
(C) 4
(D) 8
19. : What symbol is used to represent a don’t-care condition in Quine-McCluskey?
(A) #
(B) –
(C) X
(D) *
20. : When are don’t-care conditions used in simplification?
(A) When the function is always 1
(B) When inputs are unknown
(C) When output is irrelevant
(D) When outputs must be 0
21. : Which is more suitable for 2 to 4 variables?
(A) Quine-McCluskey
(B) Tabulation
(C) K-Map
(D) Petrick’s method
22. : Which method is more systematic and suited for computer implementation?
(A) K-Map
(B) Quine-McCluskey
(C) DeMorgan’s method
(D) Boolean expansion
23. : What is the complexity of the Quine-McCluskey method with more variables?
(A) Linear
(B) Logarithmic
(C) Exponential
(D) Constant
24. : What is a limitation of Karnaugh Maps?
(A) Can’t simplify expressions
(B) Too simple for small circuits
(C) Difficult to use beyond 4-6 variables
(D) Only works with don’t-care terms
25. : Which term best describes a group of minterms that differ in only one variable?
(A) Prime implicant
(B) Binary pair
(C) Adjacent pair
(D) Implicant
26. : What is the goal of using simplification techniques in digital logic?
(A) Increase delay
(B) Minimize components
(C) Maximize variables
(D) Add redundancy
27. : Which simplification method is prone to visual errors in large-variable cases?
(A) Boolean laws
(B) Karnaugh Map
(C) Quine-McCluskey
(D) Algebraic minimization
28. : Which method involves binary comparisons and charting?
(A) K-Map
(B) DeMorgan’s theorem
(C) Quine-McCluskey
(D) SOP conversion
29. : How many 1’s does the binary number 1011 have?
(A) 1
(B) 2
(C) 3
(D) 4
30. : Which method would be preferred for automated logic simplification?
(A) Algebraic method
(B) Karnaugh Map
(C) Quine-McCluskey
(D) Truth table