Professional Documents
Culture Documents
20112eem16 2 Homework1
20112eem16 2 Homework1
2. Boolean Algebra: Prove the following expressions (write down identities used):
a. x’y’z + yz + y’z = z
b. (x+y)(x+z) = x + yz
3. Boolean Simplification: Simplify the following functions using the postulates and
theorems of Boolean Algebra. Write the particular law or theorem you are using
in each step.
a. F(x,y) = xy + xy’
b. F(x,y,z) = y’z + x’yz + xyz
c. F(x,y,z) = (x + y)(x’ + y + z)(x’ + y + z’)
d. F(w,x,y,z) = (x + xyz) + (x’yz + x’y) + wx + wx’
5. Combinational Logic Design: Write the (i) high-level description, (ii) truth table,
and (iii) one-set and zero-set for the function described by the following
specification.
a. A 2-bit-wide shifter takes two input signals, i0 and i1, and shifts them to
two outputs, o0 and o1, under the control of a SHIFT signal. If this signal
SHIFT is false, then the outputs are equal to their corresponding inputs. If
SHIFT is true, then o1 is equal to i0, and o0 is set to 0.