You are on page 1of 5

Assignment

Batch: 2010 2014

VINAYAKA MISSIONS UNIVERSITY


Vinayaka Missions Kirupananda Variyar Engineering College

SALEM 636 308 Semeste


B.E. BIOMEDICAL ENGINEERING E347528 ANALOG AND DIGITAL ICs Mr.Mathan Kumar.S 3

Programme Subject Code & Name Name of the Tutor Assignment. No. Date of Announcement

Date of Submission Two (or) Three lines explanation / Short Calculation

PART A

1. Define radix. 2. What do you mean by literal? 3. Name the two canonical forms of Boolean algebra. 4. How many inputs are required for F = ACD + ABD + BEF ? 5. What are the number systems? 6. Define the following: Minterm and Maxterm. 7. What is meant by prime implicant? 8. Convert the given binary (1101010110)10 into gray code. 9. Distinguish between 1s and 2s complements. 10. 11. 12. 13. 14. What is variable mapping? Define the terms disjunction and conjunction. State the associative law of Boolean algebra. Name the two basic types of Boolean expressions. What are the logic gates?

Signature of the Tutor EEE

Signature of the HOD /

Assignment 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 32. 33. 34. 35. Define SOP and POS.

Batch: 2010 2014

What do you meant by LSB and MSB? How will you find 2s complement of a binary number? What are the alphanumeric codes? Convert the given gray code (1011011101) into binary code. Define karnaugh maps. What code is used to label the row heading and column heading Write the truth table of AND, OR and NAND gates. Show that x' y ' z + x' yz + xy ' = x' z + xy ' . What is meant by excess 3 decimal numbers? Define the law of Boolean algebra. Write the names of universal gates. Express F = AC ' + BC in a canonical SOP form. Write any four characteristics of the 2s complement number. Convert (25)10 to binary. What are the types of karnaugh map? State and prove the consensus theorem in Boolean algebra. Write the truth table of X-OR and X-NOR. Distinguish between Boolean addition and Binary addition. What are dont care conditions and incompletely specified Simply the Boolean expression to a minimum number of literals (X +Y)(X +Y ) .

of K map and why?

functions?

36. 37. 38.

What is meant by multilevel gates networks? Simplify: abc + abc+ abc Why are NAND and NOR gates known as universal gates?

Signature of the Tutor EEE

Signature of the HOD /

Assignment 39. 40. 41. 42. 43. 44. 45. 46. 47. 48. 49. 50. 51. 52. 53. 54. PART B Define binary logic.

Batch: 2010 2014

What are the limitations of karnaugh map? Define switching function. What are the symbols used in Boolean algebra? Apply Demorgans theorem to simply A+ BC . State two significant features of tabular method of minimization Write the steps to convert POS to standard POS form. What are the weights of binary and octal numbers? Simplify: x+ x' y What are the drawbacks of K map method? State De Morgans law. Write the steps to convert SOP to canonical SOP form. What are the weights of hexadecimal and decimal numbers? Define the following terms: Boolean variable, Complement. What is the number of bits in ASCII code? What is the need for Simplify : A + AB + A + B Descriptive ( Essay Type) (6

of Boolean functions.

ASCII code?

1. i) Reduce the following function using k-map technique f ( A, B, C , D) = m(0,1, 4,8,9,10) Marks) ii) What are the methods for converting Decimal to Binary conversion? Give some examples. Marks) 2. i) Minimise the following expression in the POS form (6

Signature of the Tutor EEE

Signature of the HOD /

Assignment

Batch: 2010 2014 (6

f ( A, B, C , D ) = M (0, 2,3,8,9,12,13,15) Marks)

ii) Explain De Morgans theorem and the duality principle with proof. (6 Marks) 3. i) Minimize the Boolean expression: AB + ABC + ABC + ABC Marks) ii) Convert the given expression in to standard SOP. f ( A, B, C ) = AC + AB + BC + AC Marks) 4. i) Convert the following (37)10 to equivalent hexadecimal. Marks) ii) Convert the following (25B) 16, (5A9.B4)16 to octal and binary. (4 Marks) iii) Perform (4)10 - (9)10 using the 2s complement method. iv) Subtract (9)10 - (4)10 using 1s complement method. (3 Marks) 5. Find the following i) (CB9.F5)16 + (AB8.CD)16 ii) (9E4A)16 (5FD6)16 iii) (E75)16 * (2A)16 iv) (745)8 - (263)8 6. Subtract the following using 2s complement. (i) (ii) (iii) 11101010 & 11010101 Marks) 10101010 & 11010100 Marks) 01011101 & 11001010 (3 Marks) (3 (3 (3 Marks) (3 Marks) (3 Marks) (3 Marks) (3 Marks) (2 (6 (6

Signature of the Tutor EEE

Signature of the HOD /

Assignment (iv) 10010101 & 11100010

Batch: 2010 2014 (3 Marks)

7. i) Convert 10101011 into its equivalent Decimal, Octal, Hexadecimal. (6 Marks) ii) What the two method for Simplification of Boolean Functions (6 Marks) 8. i) Obtain the octal equivalent of (3964)10 . (3 Marks) ii) Convert octal number (1654)8 into decimal system. Marks) iii) Convert (634.640625)10 to the octal system. (3 Marks) iv) Convert (17.35)10 to binary form. Marks) 9. Minimize the expression using Quine McCluskey method. Y = ABC D + ABCD + ABC D + ABCD + ABCD + ABC D 10. i) Reduce the following function using Karnaugh map technique. f ( A, B, C , D) = m(5, 6, 7,12,13) + d (4,9,14,15) f ( A, B, C , D) = M (0,3, 4, 7,8,10,12,14) + d (2, 6) f ( A, B, C ) = m(0,1,3, 7) + d (2,5) F (W , X , Y , Z ) = m(0, 7,8,9,10,12) + d (2,5,13) 12. (6 Marks) (12 Marks) (3 (3

ii) Reduce the following function using Karnaugh map technique. (6 Marks)

11. i) Reduce the following function using Karnaugh map technique. (6 Marks)

ii) Reduce the following function using Karnaugh map technique. (6 Marks)

Signature of the Tutor EEE

Signature of the HOD /