Reference no: EM131065536

1) Which Boolean law is used to transform each of the following equations?

a. B + (D + E) = (B + D) + E 

b. CAB=ABC

c. (B + C)(A + D)=  BA + BD + CA + CD

d. D + E = E + D

2) Using Boolean algebra techniques, simplify this expression:

AB +  A(B + C) + B(B + C)

3) Write the Boolean expression for each of the logic circuits below.

4) Draw a logic circuit for circuit represented by each expression:

a. AB' + A'B

b. AB + A'B: + A'BC

c. A'B(C + D')

d. A + B[C + D(B + C')]

5) Construct a truth table for each of the following Boolean expressions:

a. A + B

b. AB

c. AB + BC

d. (A + B)C

e. (A + B)(B' + C)

6 . Decode the following ASCII coded message and then convert it in hexadecimal see.

1001000       1100101       1101100       1101100       1101111       0101110       0100000

1001000       1101111       1110111       0100000       1100001       1110010       1100101

0100000       1111001       1101111       1110101       0111111

7.  Write the message in problem 11 in hexadecimal.