Assignment

ASSIGNMENT-1

1. a) Convert the decimal number (37.125)10 into binary, octal and hexadecimal

1. b) Represent the decimal number 369 in Binary and BCD

2. a) Define Minterm and Maxterm

2. b) Find the canonical POS form of

• Y= A+B’C,
• F(a, b, c) = a’b + b’c + ac

3. a) Reduce the following Boolean expression

• i)xy’z + x’y’z + xyz.
• ii)W’X(Z’+YZ) + X(W+Y’Z).

3. b) Prove Demorgan’s theorem & Find the compliment of expression

• xyz + xyz’ + xy’z

4. a) define prime implicants, essential prime implicants

4. b) Minimise F (x1, x2, x3) = p M (0,1,2,3,4,5,6) using k map

5. Minimize the following expression using K-Map into SOP and POS forms.

• Realize them with NAND gate only and NOR gate only F (A, B, C, D) = Ʃm(0,2,4,9,12,15)+d(1,5,7,10)

6. Simplify using Quine – Mccluskey method

• F (a, b, c, d) = Sm (1, 2, 3, 5, 7, 9, 10, 11, 13, 15)

7. a) Explain the representation of signed binary numbers

7. b) Explain the implementation of adder/subtractor circuit

8. Implement the following circuits

• Full Adder, Full subtractor

8. b) Write the Boolean expression for the given truth table and draw the logic diagram

X	Y	A	B
1	0	1	0
1	1	1	1
0	1	1	0
1	1	0	1

9. Design the BCD to Excess 3 code converter

10. a) Draw the multiple-level NOR circuit for the following expression:

• CD (B + C) A + (BC’+ DE’)

10. b) Draw the multiple-level NAND circuit for the following expression:

• W (x + y + z)+ xyz

 

 ASSIGNMENT- 2

ASSIGNMENT- 3