Tutorial 6 : Boolean Algebra

Exercise 1
1. Simplify the Boolean expression (x' + y)' + x' Ans: x' + y', which can also be written as (x y)' 2. Simplify the Boolean expression [(x z') (y + x)] + (x y') Ans: x (y' + z'), or x (y z)' 3. Use the laws of Boolean algebra to simplify the Boolean expression x + [y (y' + x)]
1

Tutorial 6 : Boolean Algebra

Exercise 2
Write the Boolean function given by the following table in disjunctive normal form (Sum Of Product form)
x 0 0 0 0 1 1 1 1 y 0 0 1 1 0 0 1 1 z 0 1 0 1 0 1 0 1 G 0 0 0 1 0 0 1 1

Tutorial 6 : Boolean Algebra

Exercise 3
Simplify the following Boolean expressions, and draw the digital circuits for both the original and simplified expressions :

Exercise 4

x' y x( x y ' )

Use Karnaugh maps to simplify the following Boolean expression :

3