ASSIGNMENT -1 DIGITAL CIRCUITS DESIGN

UNIT-1
1 A) If A = -57 and B = +38. Find (i) A+B (ii) A-B using 2’s complement method.

B) Draw the circuit diagram of EX-OR gate using

(i) NAND gates only ii) NOR gates only.

2. A) Find the complement and dual of the given function: xy+x(wz+wzI )

B) Convert the following.

(i) (197.56)10 = (-----------------)2 (ii) (68BE)16 = (--------------)8

(iii) (2598.675)10= (------------------)16 (iv) (367.23)8=(-----)16

3 A) Convert the expression into sum of products and product of sums. X'+X(X+Y')(Y+Z')

B) Implement the following Boolean function with NAND gates only.

F(X, Y, Z) = ∑m (1, 2, 3, 4, 5, 7)

4 A) Express the Boolean function F=A+BC’+ABC’ in to Standard Product of Sum term.

b) Reduce the following expressions using k-map. F(A,B,C)=AB+AB’C+A’BC’+BC’

5 A) Represent the decimal number (6248)10 in i) BCD ii) Excess‐3 code and iii) 2421 code

B) Determine the base of the numbers for the following operation to be correct: 24 +17 = 40.

6 A) Represent (54)10 using (4M) i) BCD ii) 3321 code

B) Convert the following number with indicated bases to decimal.

i) (1 0 1 1 1 1)2 ii) (A 3 B.3C) 16 iii) (2 3 7)8

7 A) Convert the decimal number (431)10 to binary in two ways:

(i) convert directly to binary (ii) convert first to hexadecimal and then from hexadecimal to
binary. Which method is faster?

B) Obtain the 1’s and 2’s complements of the following binary numbers:

(i) 10000101 (ii) 11111111.

8 A) Find the r’s complement and (r-1)’s complement of the following numbers.
 (i) (101101)2 (ii) (734)8 ( iii) (FA3)16

B) Compute the following

(i) (10001)bcd + (11001)bcd = (__________)bcd

(ii) (1001)bcd + (0010)bcd = (__________)2

9 A) a) Solve for X. (7M) (i) (1256)8 = (X)2 (ii) (19.125)10 = (X)8 (iii) (10011.11)2 = (X)16

B)Encode the decimal numbers using 6,3,1,-1 weighted code.Is it a self complementing code?

10 A) Find the dual of the following Boolean expressions.

(i) 𝑥𝑦 𝑧 + 𝑥 𝑦 (ii) 𝐴𝐵+𝐶𝐷 + 𝐸

B) Simplify the following Boolean expressions using Boolean algebra.

(i) 𝑥 𝑦 + 𝑥 𝑦 + 𝑥𝑦 (ii) A’C’+ABC +AC’

11 A) Convert the hexadecimal number (64CD)16 into binary, and then convert it from

binary to octal.

B) Perform subtraction on the given unsigned binary numbers using the 2’s

Complement of the subtrahend. (i) 10011 - 10010 (ii) 100010 – 100110

12 A) Compute the following

(i) (1011010)2 = ( _____ )gray. (ii) (11001011)gray=(_____________)2.

B) Convert the numbers (149)10 and (342)10 to Excess-3-code.

13 A) Convert the following numbers with the indicated bases to decimal: i) (4310)8 ii) (198)12

B) Determine the base of the numbers in each case for the following operations to

be correct: i) 14/2 = 5 ii) 54/4 = 13

14 A) Convert the following numbers with the indicated bases to decimal: i) (435)8 ii) (345)6
B) The solutions to the quadratic equation x2 - 11x + 22 = 0 are x =3 and x = 6. What is the
base of the numbers?

15 A) Discuss by an example, the operation of binary number subtraction using the method

of 1’s and 2’s complement.

B) Describe how signed number is represented in two's complement form.

16 A) Write the equivalent (743)10 in BCD, 2421 and 6421 codes.
B) What are the different types of non weighted codes and explain them with examples.

17 A) Convert (1101) binary code to gray code with detailed steps.

. B) Perform the addition of the following XS-3 codes
(i) 109 + 778 (ii) 204.6 + 185.56
18) A) State and prove Demorgan’s theorem.
. B) Draw the logic circuits for the realization of basic operations using only NOR gates.

19) Simplify the following Boolean expressions to a minimum number of literals

i) 𝑥̅ 𝑦̅ 𝑥𝑦 𝑥̅ 𝑦 ii) (𝑥 𝑦) (𝑥 𝑦̅) ii) 𝑥̅ 𝑦 𝑥𝑦̅ 𝑥𝑦 𝑥̅ 𝑦̅

20) A) Find the complement of the following Boolean expressions

i) 𝑥𝑦̅ 𝑥̅ 𝑦 ii) (𝐴𝐵̅ 𝐶)𝐷 ̅ 𝐸

B) Using De-Morgan’s theorem, convert the following Boolean expression to

equivalent expression that have only OR and complement operations
F=𝑥̅ 𝑦̅ 𝑥̅ 𝑧 𝑦̅𝑧
Unit 2

1. Simplify the following three variable Boolean expression using karnaugh map method.
Y= ABC' +A'B'C'+ABC+AB'C' and F=A'BC+ABC'+ABC+AB'C'

2. Explain the operation of half adder? Realize full adder using logic gates.
3. Explain the operation of half subtractor? Realize full subtractor using logic gates.
4. Discuss the functional principle of 4-bit ripple carry adder. what is its major disadvantage?
5. What is decoder? Draw the logic diagram of 3 to 8 line decoder and explain its operation.
6. What is the difference between encoder and priority encoder? Give the implementation of a
4-bit priority encoder?
7. Draw the circuit diagram of a 4-bit adder/subtractor and briefly describe its functional
principle.
8. Implement the following function with 8 to 1 multiplexer:

9. Realize the logic expression given below using a (i) 8:1 MUX (ii) 16:1 MUX
f=∑ m (0,1,3,5,8,11,12,14,15)
10. Design a 32:1 multiplexer using two 16:1 and 2:1 multiplexers. Implement the following
multiple output combinational logic circuit using a 4 to 16 decoder:
F1=∑ m (0,1,4,7,12,14,15), F2=∑ m (1,3,6,9,12), F3=∑ m (2,3,7,8,10) and F4=∑ m (1,3,5)
11. Implement the full adder sum and carry functions with decoder and multiplexers.
12. Develop a 3-to-8 line decoder using NOR gates only, and draw its logic diagram.
13. A combinational circuit is defined by the following equations:
f l = AB + A'B'C', f2 = A + B + C', f3 = A'B + AB'. Design a circuit which will implement

these three equations using a decoder and NAND gates external to the decoder.

14. Design a combinational circuit that detects an error in the representation of a decimal digit
in BCD. The output of the circuit must be equal to logic 1 when the inputs contain any one
of the six unused bit combinations in the BCD code.
15. A combinational circuit is defined by the following three functions F1 = x'y'+xyz', F2 = x'+y,
F3=xy+x'y'. Design the circuit with a decoder and external gates.
16. A logic function has four inputs A, B, C and D that will produce output 1 whenever two
adjacent input variables are 1’s. Treat A and D are also adjacent. Implement this logic
function using 8 x 1 and 4 x 1 multiplexers.
17. Obtain the minimal expression for Ʃm(2,3,5,7,9,11,12,13,14,15) and implement it in NOR
logic; Obtain the minimal expression for ПM(2,3,5,7,9,11,12,13,14,15) and implement it
in NAND logic
18. With the use of maps, find the simplest sum-of-products form of the function F = fg where
f = abc' + c'd + a'cd' + b'cz' and g = (a + b + c' + d')(b' + c' + d)(a' + c + d')