Scribd
Upload
6 views

Sheet Logic

Uploaded by

Ayat Nabil
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

Sheet Logic

Uploaded by

Ayat Nabil
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Sheet 2

1- Demonstrate the validity of the following identities by means of truth


tables:
(a) DeMorgan’s theorem for three variables: (x + y + z)’= x’y’z’ and (xyz)’ =
x’ + y’ + z’
(b) The distributive law: x + yz = ( x + y )( x + z )
(c) The distributive law: x(y + z) = xy + xz
(d) The associative law: x + (y + z) = (x + y)+z
(e) The associative law and x(yz) = (xy)z
2- Simplify the following Boolean expressions to a minimum number of
literals:
(a) xy + xy’
(b) (x + y) (x + y’)
(c) xyz + x’y + xyz’
(d) (A + B)’(A’+ B’)’
(e) (a + b + c’)(a’ b’ + c)
(f) a’bc + abc’ + abc + a’bc’
3- Simplify the following Boolean expressions to a minimum number of
literals:
a) (a) ABC + A’B + ABC’
b) (b) x’yz + xz
c) (c) (x + y)’(x’ + y’)
d) (d) xy + x(wz + wz’)
e) (e) (BC’ + A’D) (AB’ + CD’)
f) (f) (a’ + c’) (a + b’+ c’)
4- Reduce the following Boolean expressions to the indicated number of
literals:
(a) A’C’ + ABC + AC’ to three literals

(b) (x’y’ + z)’ + z + xy + wz to three literals

(c) A’B(D’ + C’D) + B(A + A’CD) to one literal

(d) (A’+ C) (A’ + C’) (A + B + C’D) to four literals


(e) ABC'D + A'BD + ABCD to two literals

5- Draw logic diagrams of the circuits that implement the original and
simplified expressions in Problem 2.

6- Draw logic diagrams of the circuits that implement the original and
simplified expressions in Problem 3.

7- Draw logic diagrams of the circuits that implement the original and
simplified expressions in Problem 4.

8- Find the complement of the following expressions:

(a) xy’ + x’y


(b) (a + c) (a + b’) (a’ + b + c’)
(c) z + z’(v’w + xy)

9- For the Boolean function


F = xy’z + x’y’z + w’xy + wx’y + wxy
(a) Obtain the truth table of F.
(b) Draw the logic diagram, using the original Boolean expression.
(c) Use Boolean algebra to simplify the function to a minimum number of
literals.
(d) Obtain the truth table of the function from the simplified expression
and show that it is the same as the one in part (a).
(e) Draw the logic diagram from the simplified expression and compare the
total number of gates with the diagram of part (b).

You might also like