# GATE2004-17

2.2k views

A Boolean function $x’y’ + xy + x’y$ is equivalent to

1. $x' + y'$
2. $x + y$
3. $x + y'$
4. $x' + y$
0

0
One simple way of doing such type of questions is :

step1 - Draw the k-map for the given inputs

$x'y' + x'y = x'(y+y') = x'$
$x' + xy = x' + y$

edited
0
how x' + xy = x' + y ????
1
x' + xy = x'(y+y') + xy

=x'y + x'y' + xy

=x'y + x'y + x'y' + xy                   (because AB+AB+AB+.......................=AB)

=(x'y + x'y') + (x'y + xy)

=x'(y+y') + y(x+x')

=x'+y
0

how x' + xy = x' + y ????

$x' + x.y$   [ In this case $+$ is distributed over $.$  (In boolean algebra this is also possible.]

$x' + x.y=(x'+x).(x'+y)$

$x' + x.y=(1).(x'+y)$         $[\bar{A}+A=1]$

$x' + x.y=(x'+y)= x'+y$

use K map
0
Use distribution rule  ...
= X'Y' + XY +X'Y

= X' ( Y + Y' ) + Y ( X + X')

= X' + Y

hence option d is correct
1 vote

Using K map for two variables

 y' y x' 1 1 x 0 1

Tables for expression given looks like this from this we get:

x'+y

1 vote

x'y'+xy+x'y

=x'(y'+y)+xy

=x'.1 +xy

=x'+xy

=(x'+x).(x'+y)

=1.(x'+y)

=x'+y

ans-d

## Related questions

1
5.2k views
Let $A = 1111 1010$ and $B = 0000 1010$ be two $8-bit$ $2’s$ complement numbers. Their product in $2’s$ complement is $1100 0100$ $1001 1100$ $1010 0101$ $1101 0101$
If $73_x$ (in base-x number system) is equal to $54_y$ (in base $y$-number system), the possible values of $x$ and $y$ are $8, 16$ $10, 12$ $9, 13$ $8, 11$
In an $SR$ latch made by cross-coupling two NAND gates, if both $S$ and $R$ inputs are set to $0$, then it will result in $Q = 0, Q' = 1$ $Q = 1, Q' = 0$ $Q = 1, Q' = 1$ Indeterminate states
The function $A \bar B C + \bar A B C + AB \bar C+ \bar A \bar B C+ A \bar B \bar C$ is equivalent to $A \bar C + AB+ \bar A C$ $A \bar B+ A \bar C+ \bar A C$ $\bar A B+ A \bar C+ A \bar B$ $\bar AB+ AC+ A \bar B$