Question: 2 . 2 Simplify the following Boolean expressions to a minimum number of literals: ( a ) ? 4 x y + x y '

2.2 Simplify the following Boolean expressions to a minimum number of literals:
(a)?4xy+xy'+x'y
(c)xy(x'+y')'
(b)(x+y)(x'+y)
2.3 Simplify the following Boolean expressions to a minimum number of literals:
(a)**xyz+x'y+xyz'
(c)**(x+y)'(x'+y')
(b)*x'yz+xz
(e)**(yz'+x'w)(xy'+zw')
(d)?**xy+x(wz+wz)
(9)(x'+z')(x+y'+z')
2.4 Reduce the following Boolean expressions to the indicated number of literals:
(a)x'y'z+x'yz+xy'
to three literals
(b)(w'+y)(w'+y')(w+x+yz)
to four literals
2.5 Draw logic diagrams of the circuits that implement the original and simplified expressions
in Problem 2.2(c),(e), and (f).
2.6 Draw logic diagrams of the circuits that implement the original and simplified expressions
in Problem 2.3(a),(c), and (f).
2.7 Draw logic diagrams of circuits that imptement the original and simplified expressions in
Problem 2.4(a),(c), and (e).
2.8 Find the complement of F=x'y+yz'; then show that FF'=0 and F+F'=1.
2.9.) Find the complement of the following expressions:
(a)*xy'z+x'yz+xyz
(b)x'y'z'+x'yz'+xy'z'+xy'z+xyz'
(c)(xy'+w'z)(wx'+yz')
2.10 Given the Boolean funclions F1 and F2, show that
(a) The Boolepn function E=F1+F2 contains the sum of the minterns of F1 and F2.
(b) The Booleth function G=F1F2 contains only the misterms that are common to F1
and F2.
2.11 List the truth table of the function: and draw corresponding circuits.
(a)F=xz+xy'+yz'
(b)F=a'b'c'+ab'c+a'bc'+abc'
2 . 2 Simplify the following Boolean expressions

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!