Digital Logic and Design MCQs with Answers
Practice important Digital Logic and Design MCQs with answers and explanations.
Chapter: 12
Q341:
Which output is set to 1 when the input numbers are equal in a 2-bit comparator circuit?
A. A>B
B. A<B
C. A=B
D. None
Correct Answer:
C
Chapter: 12
Q342:
What is the simplified Boolean expression for A>B output in a 4-variable Karnaugh map?
A. A B + A B B + A A B
B. A B + A A B B + A B B
C. A B + A B C + A C B
D. A B + A B D + C B
Correct Answer:
B
Chapter: 12
Q343:
In a 4-variable Karnaugh map, how many groups of 4 cells are formed in the example for A>B output?
A. 4
B. 5
C. 6
D. 7
Correct Answer:
C
Chapter: 12
Q344:
What is the purpose of the Quine-McCluskey method in Boolean algebra simplification?
A. To group terms in Karnaugh maps
B. To perform an exhaustive search for minimal product terms
C. To manually simplify Boolean expressions
D. To find maximum product terms
Correct Answer:
B
Chapter: 12
Q345:
How many essential Prime Implicants are found in the Quine-McCluskey example for the function?
A. 2
B. 3
C. 4
D. 5
Correct Answer:
B
Chapter: 12
Q346:
Which of the following minterms is not included in the canonical sum form for the Odd-Prime detector?
A. 1
B. 7
C. 15
D. 14
Correct Answer:
D
Chapter: 12
Q347:
What does the Quine-McCluskey method help avoid in Karnaugh maps?
A. Redundant terms
B. Missing terms
C. Incorrect grouping
D. Extra variables
Correct Answer:
A
Chapter: 13
Q348:
What is the number of 1s in the minterm 7?
A. 2
B. 3
C. 4
D. 1
Correct Answer:
B
Chapter: 13
Q349:
Which minterm has 4 1s in its binary representation?
A. 17
B. 23
C. 29
D. 31
Correct Answer:
B
Chapter: 13
Q350:
In the Quine-McCluskey method, minterms 1 and 3 eliminate which variable to form the product term ABCE?
A. A
B. B
C. C
D. D
Correct Answer:
D
Chapter: 13
Q351:
How many Prime Implicants are listed in table 13.4?
A. 5
B. 8
C. 10
D. 14
Correct Answer:
B
Chapter: 13
Q352:
What is the simplified expression for the Adjacent 1s Detector circuit using the SOP form?
A. AB + CD + BC
B. ACDE + BCDE + ABE + BCE + BDE
C. (A + C)(B + C)(B + D)
D. AB + BC + CD
Correct Answer:
B
Chapter: 13
Q353:
In the SOP implementation of the Adjacent 1s Detector, how many gates are required in total?
A. 10 gates
B. 8 gates
C. 4 gates
D. 12 gates
Correct Answer:
A
Chapter: 13
Q354:
What is the simplified POS expression for the Adjacent 1s Detector circuit?
A. AB + BC + CD
B. (A + C)(B + C)(B + D)
C. AB + CD + BC
D. ABE + BCDE + ACDE + BDE
Correct Answer:
B
Chapter: 13
Q355:
Which form of Boolean expression involves summing product terms?
A. POS
B. SOP
C. K-map
D. Quine-McCluskey
Correct Answer:
B
Chapter: 13
Q356:
The Adjacent 1s Detector circuit can be simplified to use only which type of gates in NAND implementation?
A. NOR gates
B. AND gates
C. XOR gates
D. NAND gates
Correct Answer:
D
Chapter: 13
Q357:
What is the total gate count for the POS based implementation of the Adjacent 1s Detector?
A. 19 gates
B. 8 gates
C. 4 gates
D. 10 gates
Correct Answer:
A
Chapter: 13
Q358:
What type of circuit output is indicated by a logic 1?
A. Active-low
B. Active-high
C. Passive-low
D. Passive-high
Correct Answer:
B
Chapter: 13
Q359:
How is an active-low output circuit created?
A. By adding NOT gates to inputs
B. By adding bubbles to the output
C. By removing NOT gates from outputs
D. By connecting inputs directly
Correct Answer:
B
Chapter: 13
Q360:
Which of the following is NOT a valid method to simplify Boolean expressions?
A. Quine-McCluskey method
B. Karnaugh map
C. SOP and POS forms
D. Digital Circuit Analysis
Correct Answer:
C