Digital Logic and Design MCQs with Answers
Practice important Digital Logic and Design MCQs with answers and explanations.
Multiple Choice Questions
Q291: In Boolean algebra, what is the result of A.B.C.D when A=1, B=1, C=1, and D=0?
- A: zero
- B: 1
- C: Undefined
- D: 0.5
View Answer
A
Q292: Which Boolean theorem can simplify the expression A + A.B?
- A: Demorgan's Theorem
- B: Distributive Law
- C: Complement Law
- D: Absorption Law
View Answer
D
Q293: What is the simplified form of the Boolean expression (A.B.C).(C + D)?
- A: A.B.C.D
- B: A.B.C + C.D
- C: A.B + C.D
- D: A + B + C
View Answer
A
Q294: How is the Boolean expression A.B + A.B.C.D simplified using Demorgan’s theorem?
- A: A.B.C.D
- B: A.B
- C: A.B + A.C.D
- D: A.B.C.D
View Answer
B
Q295: For the Boolean expression A + B.C, which logic gate combination would implement it?
- A: AND-OR gates
- B: OR-AND gates
- C: NOR-NAND gates
- D: AND-NOR gates
View Answer
A
Q296: What is the result of X = A.B and Y = C + D when X=1 and Y=1?
- A: 1
- B: zero
- C: Undefined
- D: 0.5
View Answer
B
Q297: What does a truth table for the expression A.B + A.B.C.D indicate when A=1, B=1, C=1, and D=1?
- A: zero
- B: 1
- C: Undefined
- D: 0.5
View Answer
B
Q298: How is the Boolean function F = A.B.C.D implemented using logic gates?
- A: OR gates
- B: AND gates
- C: NOR gates
- D: XOR gates
View Answer
B
Q299: Which form is used to represent Boolean expressions in canonical form?
- A: SOP
- B: POS
- C: Both SOP and POS
- D: Neither SOP nor POS
View Answer
C
Q300: The carry output of a full adder is obtained from ________
- A: OR gate
- B: AND gate
- C: XOR gate
- D: NOR gate
View Answer
B