DIGITAL LOGIC DESIGN
ASSIGNMENT 1
Due date: 10.12.2020 (Thursday)
This assignment is designed to give you practice with:
1. Number systems, Complements
2. Binary codes
3. Binary logic gates
4. Simplification using Boolean algebra rules
5. Simplification of Boolean Functions using K-map
6. Circuit implementation using universal NAND and NOR gates
Q.1(a) Write the table for the weighted code 3, 3, 2, 1 for the decimal digits so that the 9’s
complement of each decimal digit is obtained by changing 1’s to 0’s and 0’s to 1’s.
(b) Determine the base of the numbers in each case for the following operations to be correct
i) 14/2=5 ii) 24+17=40
(c) Convert following numbers:
i. (1001010.01101)2 to Decimal, Octal & Hexadecimal.
ii. (123.8)10 to Binary, Octal & Hexadecimal.
iii. (AB9E)16 to Binary, Decimal & Octal.
iv. (28)7 to Base 10.
Q.2(a) John and Abhisekh are having an argument. John says “I can get the two's complement of
a number by subtracting 1, then inverting all the bits of the result. Abhisekh says, “No, I
can do it by examining each bit of the number, starting with the least significant bit.
When the first 1 is found, invert each subsequent bit”. Do you agree with John or
Abhisekh or both or neither. Explain.
(b) Solve the following questions:
i. Perform 5260-435 using 10’s and 9’s complement.
ii. Perform 234-428 using 10’s and 9’s complement..
iii. Perform (11010)2 – (1101)2 using 2’s and 1’s complement.
iv. Perform (1010100)2 – (1010100)2 using 2’s and 1’s complement.
(c) Obtain the r’s & (r-1)’s complement of the following:
a. (10101)2
b. (.0101)2
c. (387)10
d. (653.26)10
Q.3(a) Obtain a binary code to represent all base 6 digits so that the 5’s complement is obtained
by replacing 1's to 0's and 0's to 1's in the bits of the code.
(b) Represent the decimal number 9865 in (a) BCD (b) Excess-3 code (c) 2 4 2 1 code
Q.4 Obtain the simplified expression in i) product of sum form and ii) sum of product form:
a) F(A, B, C) = (000 + 001 + 010 + 011 + 111)
b) F(A, B, C, D) = AB + AC ' + C + AD + AB'C + ABC
c) F(W, X, Y, Z) = (0+1+0+0) (0 + 1 + 1 + 0) (0 + 1 + 1 + 1)
d) F(A, B, C, D) = (B’ + D) (A’ + B + C’) (A + B’+ C ) (A + B + C’)
e) F= W’(X’ Y + X’ Y’ + XYZ ) + X’ Z’ (Y + W) d = W’ X ( Y’ Z + Y Z’) + W Y Z
f) F = ACE + A’ C D’ E’ + A’ C’ D E d = D E’ + A’ D’ E + A D’ E’
Q.5 What do you mean by self-complementing codes? Give examples.
Q.6 Write Boolean expression for each of the truth table
Q.7 Simplify the following Boolean functions to specified number of literals:
i. F=A [B +C' (AB' +AC')] (to 3 literals)
ii. F=A +B [AC + (B+C') D] (to 3 literals)
iii. F=AB'C + B + BD' + ABD' +A'C (to 2 literals)
iv. F=(B+BC) (B+BC') (B+D) (to 1 literal)
Q.8 Obtain the real minimal expression for f =∑ (0,2,4,6,7,8,10,12,13,15) and implement it
using universal gates.
Q.9 Implement the Boolean function
F=xy +x' y' +y'z
(a) With AND,OR and inverter gates
(b) With OR and inverter gates
(c) With AND and inverter gates
(d) With NAND and inverter gates and
(e) With NOR and inverter gates
Q.10 Generate the Excess-3 code for the given numbers:
a) 597 b) 239 c) 354 d) 672
Q.11 Convert the following into the gray number
a) (3 A 7) 16 b) (5 2 7) 8 c) (6 5 2)10
Q.12 In an Even-parity scheme, which of the following words contain an error?
a) 10101010 b)11110110 c)10111001
