1. A1(XYZ) = (X+Y)(X' +Y + Z') a. Using Boolean Manipulation, convert the given Boolean Expression into a form suitable for an ALL-NAND implementation.

Convert the function F = A' + B'C + BC'D' to а. a two-level NAND-NAND form b. a two-level NOR-OR form

2. Implement the logic circuit and the truth table for the Boolean expressions shown below. X = (A + BC) + (AB) + (CAB) X = A + B[C+D(B+C)] X = ĀB (C+ D)

Simplify the following expression and implement it using NOR gate. F(A,B,C,D)=Em(1,2,4,11,13,14,15)+Ed(0,5,7,8,10)

Simplify the given Boolean function and design half and full adder according to given input symbols. S(x, y, z)                 =             XY’Z’+X’YZ’+XYZ+X’Y’Z = Z⊕ (X⊕Y)

3.3. Using DeMorgan's Law, write an expression for the complement of F if F(x, y, z) = xỹ(x + z).

just b

4. Convert the following expressions into sum-of-products and product-of-sums forms: (a) (XY+Z) (Y+XZ) (b) (A+B)(B+C) (c) WXY+WXZ+WXZ+YZ

Simplify the Boolean function F = a’(b+c’)(a+b’+c) a’b’c’ in the SOP Form SOP :   F= X'Y'Z+X'YZ'+XY'Z'+XYZ '  = X'(Y'Z+YZ') + XZ'(Y+Y')   = X'Y'Z + X'YZ'+XZ'

A combinational circuit is described by this Boolean Expression: F(A,B,C,D) = 2m(0,2,4,8,9) i) Minimise the Boolean Expression given above using a Karnaugh map. ii) Given Don't Care conditions d = Em (10,11,12), use a separate Karnaugh map to demonstrate how you would further simplify the expression in part i). iii) Use Switching Algebra to show how you would implement the function obtained in part ii) by using NAND gates only. Provide a circuit diagram in your answer. Show all your working.