Assignment-1
1. Convert the following numbers from the given base to the base indicated:
(a) Decimal 225.225 to binary , octal, and hexadecimal
(b) Binary 11010111.110 to decimal, octal and hexadecimal
(c) Octal 623.77 to decimal, binary and hexadecimal
(d) Hexadecimal 2AC5.D to decimal, octal and binary
2. Obtain the 1’s and 2’s complement of the following binary numbers: 1010101, 0111000,
0000001.
3. Obtain the 9’s and 10’s complement of the following numbers: 13579, 09900,90090,
10000
4. Perform the subtraction with the following decimal numbers using (1) 10’s complement
and (2) 9’s complement.
(a) 5250-321 (b) 753-864 (c) 3570-2100 (d) 20-1000
5. Perform the subtraction with the following binary numbers using (1) 1’s complement and
(2) 2’s complement.
(a) 11010 – 1101 (b) 10010 – 10011 (c) 11010 -10000 (d) 100-110000
6. (a) Convert the following binary numbers into Gray codes
10110, 1110111, 101011101, 110110011, 10101110001
(b) Convert the following Gray code into binary digits:
10111, 1110011, 1001101101, 111011001, 1010101101
7. Simplify the following Boolean function to a minimum number of literals.
(a) xy + xy’
(b) (x + y)(x + y’)
(c) Xyz + x’y + xyz’
(d) (A + B)’(A’ +B’)’
(e) Y(wz’ + wz) + xy
8. Reduce the following Boolean expressions to the required number of literals
(a) ABC + A’B’C + A’BC + ABC’ + A’B’C’
(b) [(CD)’ + A]’ + A + CD +AB
(c) (BC’ +A’D)(AB’ + CD’)
(d) (A + C + D)(A + C + D’)(A + C + D)(A + B’)
9. Express the following function in a sum of minterms and a product of maxterms.
(a) F(A, B, C, D) = D(A’ + B) + B’D
(b) F(A, B, C) = (A’ + B)(B’ + C)
(c) F(w, x, y, z) = y’z + wxy’ + wxz’ + w’x’z
(d) F(x, y, z) = (xy + z)(y + xz)
10. Convert the following to the other canonical form
(a) F(x, y, z) = (1,3,7)
(b) F( A, B, C, D) = (0,2,6,11,13,14)
(c) F(x, y, z) = (0,3,6,7)
(d) F( A, B, C, D) = (0,1,2,3,4,6,12)
11. A majority gate is a digital circuit whose output is equal to 1 if the majority of the inputs
are 1’s. The output is 0 otherwise. By means of a truth table find the Boolean function
implemented by a 3-input majority gate. Simplify the function using k-map and design
the logic circuit diagram.
12. Obtain the simplified expression in Sum of Products form and draw the gate
implementation of the simplifies Boolean function using AND and OR gates
(a) (A +B’ + D)(A’ + B + D) (C + D)(C’ + D’)
(b) w’yz’ + vw’z’ + vw’x + v’wz + v’w’y’z’
13. Simplify the Boolean function F using the don’t –care condition d, in Sum of Products
form
(a) F = A’B’D’ + A’CD + A’BC d = A’BC’D + ACD + AB’D’
(b) F = w’(x’y + x’y’ + xyz) = xz’(y + w) d= w’x(y’z + yz’) + wyz
14. F (A, B, C, D) = (0,2,35,6,7,8,9) with (10, 11, 12, 13, 14, 15) as don’t cares, realized
the minimized function using NOR gates.
15. Seven switches operate a lamp in the following way: if switches 1, 3, 5 and 7 are closed
and switch 2 is opened, or if the switches 2, 4 and 6 are closed and switch 3 is opened, or
if all seven switches are closed, the lamp will light. Use NOT, AND and OR gates to
show how the switches must be connected
