Simplify and draw the Boolean function: 1- AB+ A(B+C)+B(B+C). 2- [AB(C +BD) + A BC 3- ABC+ ABC+ A BC+ ABC+ ABC

Simplify Boolean function  using K map. Variables are marked in order of x,y,z. 1 d d 0 d 1 1 1   Question 41 options:   x + y   x + y’               xz + y’               y’+z   None of the above

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

Construct table of minterms and maxterms for 4 variables - x,y,z,w Obtain the truth table of the following functions, and express each function in sum-of-minterms (canonical SOP) and product-of-maxterms ( canonical POS) form: a) (xy+z)(y+x'z) b) (x+y)(y'+z) c) x'z+wx'y+wyz'+w'y' d) (xy+yz'+x'z)(x+z) Simplify the following Boolean functions T1 and T2 to a minimum number of literals: T2 0 0 0 1 1 1 1 1 A OOO 0 0 0 LLLL 1 1 1 1 B 0 0 1 1 0 0 1 1 C 0 1 0 1 0 1 اهای 1 T1 1 1 1 0 0 0 0 0

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'

3. Use the Karnaugh-Map to simplify the following expressions F(A, B, C) = ABC + ABC + ABC + ABC + ABC F(A,B,C,D) = A + AB + ABC + BCD + ACD ii.

Simplify these Boolean expressions from 1 and 2.  1  (A+B)(A+B’) 2   ABC+A’B+ABC’