2,005 views
1 votes
1 votes

Using DeMorgan’ s theorem, Convert the following Boolean Expressions to the Equivalent Expressions that have only OR and Complement Operation. Show that the function can be implemented with the logic diagram that have OR gate and inverter Only. 

(a) F = x’y’ + x’z + y’z

(b) F = (y + z’)(x + y)(y’ + z)

 

Please log in or register to answer this question.

Related questions

5 votes
5 votes
2 answers
1
ajaysoni1924 asked Mar 31, 2019
34,869 views
Express the following function in the sum of minterms and The product of the maxterms.(a) F(A,B,C,D) = B’D + A’D + BD(b)F(x,y,z)=(xy + z)(xz + y)
2 votes
2 votes
1 answer
4
ajaysoni1924 asked Mar 31, 2019
5,542 views
Obtain the truth tables of the following Boolean Functions. Express Each Function in Sum of minterm And Product of Maxterm.(xy + z)((y + xz)(A’ + B)(B’ + C)y’z + wx...