You are on page 1of 2

EE 280 (sections A1 and A3), Introduction to Digital Logic Design

Practice problems on Boolean laws and simplifications


----------------------------------------------------

(1) Using Boolean laws simplify the following Boolean expressions:
a) xy xy`
b) (x y)(x y`)
c) xyz x`y xyz`
d) (AB)` (A`B`)`

(2) Using Boolean laws simplify the following Boolean expressions:
a) ABC A`B ABC`
b) x`yz xz
c) (xy)`(x`y`)
d) xy x(wz wz`)
e) (BC`A`D)(AB`CD`)

(3) Find the complement of the following expressions:
a) xy`x`y
b) (AB`C)D`E
c) (xy`z)(x`z`)(xy)

(4) A Boolean function is called self-dual if and only if f f
D
. Which of the following
functions are self-dual?
(a) I(x, y) x, (b) I(x, y) x y x` y`, (c) I(x, y) x y, (d) I(x, y) x y x` y
!"! #$%
!"# %&'() *+( ,--.(/) 01)2*&-)
F xy`z x`y`z w`xy wx`y wxy
a) Obtain the truth table oI the Iunction.
b) Draw the circuit diagram using the original Boolean expression.
c) SimpliIy the Iunction using Boolean algebra.
d) Obtain the truth table oI the Iunction Irom the simpliIied expression and show that it
is the same as the one in part (a)
e) Draw the logic diagram Irom the simpliIied expression and compare the total number
oI gates with the diagram oI part (b)