Exams › GATE › Technical

The truth table X Y f(X,Y) 0 0 0 0 1 0 1 0 1 1 1 1 represents the Boolean function

1. X
2. X + Y
3. X ⊕ Y
4. Y

Correct answer: X

Solution

The truth table shows that the output is true (1) only when X is true (1), regardless of the value of Y, which directly corresponds to the Boolean function represented by X.

Related GATE Technical questions

• The decimal value 0.5 in IEEE single precision floating point representation has
• A process executes the code fork(); fork(); fork(); The total number of child processes created is
• The protocol data unit (PDU) for the application layer in the Internet stack is
• Which of the following problems are decidable? 1) Does a given program ever produce an output? 2) If L is a context-free language, then is L̄ also context-free? 3) If L is a regular language, then is L̄ also regular? 4) If L is a recursive language, then is L̄ also recursive?
• A binary operation ⊕ on a set of integers is defined as x ⊕ y = x² × y². Which one of the following statements is TRUE about ⊕?
• The smallest integer that can be represented by an 8-bit number in 2's complement form is

⚔️ Practice GATE Technical free + battle 1v1 →