Adic Assignment - 3 Without WM
Uploaded by
MATHANKUMAR.SAdic Assignment - 3 Without WM
Uploaded by
MATHANKUMAR.SAssignment
Batch: 2009 2013
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 23 09 2011
Programme Subject Code & Name Name of the Tutor Assignment. No. Date of Announcement
Date of Submission
27 09 2011
PART A
Two (or) Three lines explanation / Short Answer / Short Calculation
1. Define radix. 2. What are the number systems? 3. Define the following: minterm and maxterm. 4. What is meant by prime implicant? 5. Convert the given binary (1101010110)10 into gray code. 6. Distinguish between 1s and 2s complements. 7. Define the terms disjunction and conjunction. 8. What are the logic gates? 9. Define SOP and POS. 10. What do you meant by LSB and MSB? 11. How will you find 2s complement of a binary number? 12. What are the alphanumeric codes? 13. Convert the given gray code (1011011101) into binary code. 14. Define karnaugh maps.
Signature of the Tutor EEE
Signature of the HOD /
Assignment
Batch: 2009 2013
15. Write the truth table of AND, OR and NAND gates. 16. What is meant by excess 3 decimal numbers? 17. Define the law of Boolean algebra. 18. What is meant by universal gates? 19. What is Multivariable Theorem? 20. Convert (25)10 to binary. 21. What are the types of karnaugh map? 22. Write the truth table of X-OR and X-NOR. 23. Distinguish between Boolean addition and Binary addition. 24. What is meant by multilevel gates networks? 25. What are the drawbacks of K map method? 26. State De Morgans law. 27. What is the number of bits in ASCII code? What is the need for ASCII code? 28. Simplify : A + AB + A + B
PART B
Descriptive ( Essay Type) (6 Marks) (6 Marks) (6 Marks) (6 Marks) (6 Marks) (6 Marks) (2 Marks) (4 Marks)
1. i) Reduce the following function using k-map technique f ( A, B, C , D) = m(0,1, 4,8,9,10) ii) What are the methods for converting Decimal to Binary conversion? Give some examples. 2. i) Minimise the following expression in the POS form f ( A, B, C , D) = M (0, 2,3,8,9,12,13,15) ii) Explain De Morgans theorem and the duality principle with proof. 3. i) Minimize the Boolean expression: AB + ABC + ABC + ABC ii) Convert the given expression in to standard SOP. f ( A, B, C ) = AC + AB + BC + AC 4. i) Convert the following (37)10 to equivalent hexadecimal ii) Convert the following (25B) 16, (5A9.B4)16 to octal and binary.
Signature of the Tutor EEE
Signature of the HOD /
Assignment
Batch: 2009 2013 (3 Marks) (3 Marks) (3 Marks) (3 Marks) (3 Marks) (3 Marks)
iii) Perform (4)10 - (9)10 using the 2s complement method. iv) Subtract (9)10 - (4)10 using 1s complement method. 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) (iv) 7. 11101010 & 11010101 10101010 & 11010100 01011101 & 11001010 10010101 & 11100010
(3 Marks) (3 Marks) (3 Marks) (3 Marks) (6 Marks) (6 Marks) (3 Marks) (3 Marks) (3 Marks) (3 Marks)
i) Convert 10101011 into its equivalent Decimal, Octal, Hexadecimal. ii) What the two method for Simplification of Boolean Functions
8.
i) Obtain the octal equivalent of (3964)10 . ii) Convert octal number (1654)8 into decimal system. iii) Convert (634.640625)10 to the octal system. iv) Convert (17.35)10 to binary form.
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) ii) Reduce the following function using Karnaugh map technique. (6 Marks)
Signature of the Tutor EEE
Signature of the HOD /
Assignment
