Вы находитесь на странице: 1из 7

# 16 Marks

UNIT I
1 (i). Express the Boolean function F =A+BC in sum of minterms (ii) Express the Boolean function F=xy+xz in production of maxterms. Solution: F = A+BC = ABC+ABC+ABC+ABC+ABC = m1 + m4 + m5 + m6 + m 7 =_m (1,4,5,6,7) F = XY+XZ = (X+Y+Z)(X+Y+Z)(X+Y+Z)(X+Y+Z) =M0M2M4M5 = P (0,2,4,5) 2.Simplify the Boolean function F(A,B,C,D)= _(0,6,8,13,14) Together with the dont care condition d=_(2,4,10)and then express the simplified function in sum of minterms. Using 4-variable map simplify the function as F=BD+CD+ABCD Represent the simplified function in SOP from as F=_(0,2,6,8,10,13,14) 3.Implement the Boolean function F(X,Y,Z)=(1,2,3,4,5,7)with NAND gates Simplify the function using 3-varabile map and express it SOP from as F=XY+XY+Z Draw a NAND gate for each product term of the expression. This gives a group of first level gates. Draw a single gate using the AND invert or the invert -OR graphic simple in the second level, with inputs coming from outputs of first level gates. 4. Simplify the Boolean function F(A,B,C,D) =_(0,2,3,5,7,8,9,10,11,13,15)and find the