F= (~A xor ~B) or ~C F= ~A or ~B or ~C F= ((~A or B) and (~A or ~B)) or (C+~A)  Use the functions above to create digital circuits. 2- Use Boolean Algebra to simplify the following functions. F= (~A+B) (A+B)(C+A) F= ABC+ A(~B+~C)+C(A+B) F=(A+B)(A+C)(B+C)

Simplify the given expressions using only Boolean Algebra.

Can you reduce the boolean expression to four literals:(A′ + C)(A′ + C′)(A + B + C′D) and ABC′D + A′BD + ABCD to two literals

Implement the following Boolean function with an 8–to–1-line multiplexer and a single inverter with variable D as its input: F(A, B, C, D) = Σm(2, 4, 6, 9, 10, 11, 15)

1.

Q3 A: Simplify the following Boolean functions, using Karnaugh maps: F(x, y, z) = E (0,1,4,5) Q3 B: Draw a logic diagram for the Boolean functions above.

Write the - (a*b)+(c + d) - (a + b +c+d). quadruple for the expression,

Task 4: Simplifying Boolean functions Simplify the following Boolean expression F (A, B, C) = (A+C") +C (C.A' + (B.A) +C Draw the simplified Boolean expression using EWB. Find out the truth table of the circuit.

Let the Boolean function F(x, y, z) = x‾.(y + z) A. Find the values of the Boolean function F (you may copy the following table and fill it) B. Represent F using the sum-of-products expansion form x y z x‾ y + z x‾.(y + z) 1 1 1 1 1 0 1 0 1 1 0 0 0 1 1 0 1 0 0 0 1 0 0 0

Q1/ Simplify using Boolean 'algebra: F=XYZ+XY'Z+XYZ