1. >GATE CS
  2. >Digital Logic
Found 3  QuestionsSET DEFAULT
Selected Filters
    GATE CS Digital Logic Boolean Algebra and Logic Function Sim...
Exams
Years
Subjects
Topics

List of top Digital Logic Questions on Boolean Algebra and Logic Function Simplification asked in GATE CS

Which one of the following options is not a property of Boolean Algebra?
Note: + is the OR operation, \(\cdot\) is the AND operation, and \('\) is the NOT operation.
  • GATE CS - 2026
  • GATE CS
  • Digital Logic
  • Boolean Algebra and Logic Function Simplification
Consider the following 4-variable Boolean function

\[ F(A, B, C, D) = \Sigma m(0, 1, 2, 3, 8, 9, 10, 11) \]
Consider \(A\) as MSB, \(D\) as LSB. Which one of the following options represents the minimal sum of products form for the above function?

Note: + is OR operation, . is AND operation, ' is NOT operation
  • GATE CS - 2026
  • GATE CS
  • Digital Logic
  • Boolean Algebra and Logic Function Simplification
Consider the following Boolean expression of a function \( F \):
\[ F(P,Q) = (\bar{P} + Q) \oplus (\bar{P}Q) \]
Which of the following expressions is/are equivalent to \( F \)?
  • GATE CS - 2026
  • GATE CS
  • Digital Logic
  • Boolean Algebra and Logic Function Simplification