GATE Bits 21 22 Logic Gates and Boolean Algebra | Lesson 56.2| Digital Electronics | Learning Monkey

Here we will try to understand GATE Bits 21 22 Logic Gates and Boolean Algebra.

[ GATE 1999 ]
Which of the following expressions is not equivalent to x¯?

a. x NAND x
b. x NOR x
c. x NAND 1
d. x NOR 1

xx¯¯¯¯¯¯=x¯
x+x¯¯¯¯¯¯¯¯¯¯¯¯=x¯.x¯=x¯
x.1¯¯¯¯¯¯¯=x¯+0=x¯
x+1¯¯¯¯¯¯¯¯¯¯¯=x¯.0=0
ANS: (D)

[ GATE 2004 ]

The Boolean function x’y’ + xy + x’y is equivalent to
(A) x’ + y’
(B) x + y
(C) x + y’
(D) x’ + y

ANS: (D)

Explanation: x’y’+xy+xy’

=(x’y’+y(x+x’))

=x’y’+y
=x’+y

Ans (d)

Link for playlists:
https://www.youtube.com/channel/UCl8x4Pn9Mnh_C1fue-Yndig/playlists

Link for our website: https://learningmonkey.in

Follow us on Facebook @ https://www.facebook.com/learningmonkey

Follow us on Instagram @ https://www.instagram.com/learningmonkey1/

Follow us on Twitter @ https://twitter.com/_learningmonkey

Mail us @ learningmonkey01@gmail.com