Assignment No.

1
1. Convert the following numbers with the indicated bases to decimal:
a.) (4310)5
b.) (198)12
c.) (1001001.011)2
d.) (1032.2)4
2. Subtract using (i) 10’s complement (ii) 9’s complement. Check the answer by
straight subtraction.
(a) 5250 - 321 (c) 753 - 864
(b) 3570 - 2100 (d) 20 - 1000
3. Subtract using (i) 2’s complement (ii) 1’s complement. Check the answer by
straight subtraction.
(a) 11010 – 1101 (c) 10010 – 10011
(b) 11010 – 10000 (d) 100 - 110000
4. Demonstrate the validity of the following by means of truth tables
a.) De Morgan’s theorem for three variables (x+y+z)’=x’y’z’
b.) The distributive law : x+yz = (x+y) (x+z)
c.) The distributive law : x(y+z) = xy+xz
5. Simplify the following Boolean expression to a minimum number of literals, using
postulates and theorems of Boolean Algebra.
a.) xy+xy’
b.) (x+y) (x+y’)
c.) xyz+x’y+xyz’
d.) (A+B)’ (A’+B’)’
e.) y(wz’ + wz) + xy
f.) zx + zx’y
6. Find the complements of following functions and reduce them to minimum
number of literals using postulates and theorems of Boolean Algebra.
a.) (BC’ + A’D)(AB’ + CD’)
b.) B’D + A’BC’ + ACD + A’BC
c.) [(AB)’A][(AB)’B]
d.) AB’ + C’D’
7. A majority gate is a digital circuit whose output is equal to 1 if majority of inputs
are 1. The output is 0 otherwise. By means of truth table, find the Boolean
function implemented by a 3 input majority gate. Simplify the function.
8. Implement the Boolean Function:
F = xy + x’y’ + y’z
a.) Using AND, OR and NOT Gates.
b.) Using OR and NOT Gates.
c.) Using AND and NOT Gates.

9. Draw logic diagram to implement the following Boolean expressions

a.) Y=A+B+B’(A+C’)
b.) Y=A+CD+ABC
c.) Y=(A’+B’)(C+D’)
d.) Y=[(A+B’) (C’+D)]

10. Proove the logical sum of all minterms of a Boolean function of 3 variables is 1.
11. For the Boolean function
F=xy’z+x’y’z+w’xy+wx’y+wxy
a.) Obtain the truth table of F.
b.) Draw the logic diagram using the original Boolean expression.
c.) Use Boolean algebra to simplify the function to a minimum number of literals.
12. Express the complement of the following function in sum-of-minterm forms
a.) F(A,B,C,D)=∑(2,3,12,13,14,15)
b.) F(A,B,C,D)=∏(5,6,7,8,9,12,13,14,15)

13. Implement the following function with (i) four NAND (ii) four NOR gates. Only
normal inputs are available.
F = w’xz + w’yz + x’yz’ + wxy’z

14. Simplify the following Boolean expression using three variable maps:
a.) F(x,y,z)=∑(0,2,6,7)
b.) F(x,y,z)=∑(0,2,3,4,6)
c.) F(x,y,z)=∑(0,1,2,3,7)
d.) F(x,y,z)=∑(3,5,6,7)

15. Simplify the Boolean Function F using the don’t care condition d, in (i) sum of
products (ii) product of sums
a) F = A’B’D’ + A’CD + A’BC
d = A’BC’D + ACD + AB’D’
b) F = B’DE’ + A’BE + B’C’E’ + A’BC’D’
d = BDE’ + CD’E’
16. Repeat problem 15 using tabulation method.

17. Simplify the following expression using K- maps

a.) A’B’C’D’+AC’D’+B’CD’+A’BCD+BC’D
b.) x’z+w’xy’+w(x’y+xy’)
c.) A’B’C’D’+A’CD’+AB’D’+ABCD+A’BD
18. Find all the prime implicants of the following Boolean functions and determine
which are essential
a.) F(w,x,y,z)=∑(0,2,4,5,6,7,8,10,13,15)
b.) F(A,B,C,D)=∑(0,2,3,5,7,8,10,11,14,15)
19. Simplify the following using K-maps
a.) F(A,B,C,D)=∑(0,1,4,5,16,17,21,25,19)
b.) F(A,B,C,D)=A’B’CE’+B’C’D’E’+A’B’D’+B’C’D’+A’CD+A’BD
20. Simplify the following Boolean functions to product of sum forms
a.) F(w,x,y,z)=∑(0,1,2,5,8,10,13)
b.) F(A,B,C,D)=∏(1,3,5,7,13,15)