MCQ Subject: Digital Logic & Boolean Algebra

Which of the following is the correct application of De Morgan’s Theorem to the expression (A + B) · (C + D)?

A sequential circuit’s output is determined solely by its current state, independent of the input. What type of finite state machine is this?

Which of the following is the simplified Boolean expression for the Karnaugh map given below?

According to De Morgan’s Laws in Boolean Algebra, the expression ¬(A ∧ B) is equivalent to:

Given the Boolean expression (A ∧ B) ∨ (C ∧ D), apply De Morgan’s Law to simplify its negation: ¬[(A ∧ B) ∨ (C ∧ D)].

Which expression is equivalent to (A + B)’ using De Morgan’s Law?

In a Karnaugh map, which of the following combinations of cells can be minimized into a single product term?

Simplify the Boolean expression F = xy + xz + y’z using the consensus theorem.

In Boolean Algebra, which of the following represents the De Morgan’s Law for NOT (A AND B)?

Which Boolean expression represents the logic circuit minimized using the Karnaugh map for the function F(A,B,C) = Σ(3,5,6,7)?