Home › Previous year questions › GATE 2016 CS (CS1) › Question 16GATE 2016 CS (CS1) – Question 16 Digital Logic · Boolean Algebra and Minimization · 1 mark · Multiple choice
Consider the Boolean operator $\#$ with the following properties: $x \# 0 = x$, $x \# 1 = \bar{x}$, $x \# x = 0$ and $x \# \bar{x} = 1$. Then $x \# y$ is equivalent to
$x\bar{y} + \bar{x}y$ $x\bar{y} + \bar{x}\bar{y}$ $\bar{x}y + xy$ $xy + \bar{x}\bar{y}$ Practise this question in The GATE Grind →
Show answer and explanation Correct answer: (A) $x\bar{y} + \bar{x}y$
Explanation The properties match exclusive-OR. $x \oplus 0 = x$, $x \oplus 1 = \bar{x}$, $x \oplus x = 0$ and $x \oplus \bar{x} = 1$. Exclusive-OR is written $x\bar{y} + \bar{x}y$.
More Boolean Algebra and Minimization questions GATE 2017 CS (CS1) Q31 – Consider the Karnaugh map given below, where X represents "don't care" and blank… GATE 2014 CS (CS1) Q17 – Find the minimal sum-of-products form of F(P,Q,R,S)=PQ+ PQR+ PQ RS. GATE 2014 CS (CS2) Q16 – The dual FD of Boolean function F(x 1,,x n,+,,) swaps + and ·. F is self-dual when F=FD.… GATE 2014 CS (CS3) Q17 – F(P,Q,R,S)= m(0,2,5,7,8,10,13,15), with minterms 2,7,8,13 treated as don’t-cares. Find the… GATE 2014 CS (CS3) Q65 – With XOR denoted and binary constants 1,0, simplify F(P,Q)=((1 P)(P Q))((P Q)(Q0)). GATE 2016 CS (CS2) Q18 – Boolean variables satisfy x 1 x 2 x 3 x 4=0. Which must hold? All Boolean Algebra and Minimization questions →