SECTION A ANSWER ANY TEN QUESTIONS 10 x 2 =20 1. Convert the decimal number 4096 to equivalent binary number 2.

Convert the binary number 10011 to equivalent decimal number. 3. Define binary logic 4. Write all minterms of a three variable map 5. What aer maxterms. 6. Find the octal equivalent of the binary number 111110111. 7. Specify any two uses of computers. 8. Define the term operating system. 9. Draw the symbolic representation of ANDandORgates. 10. What is a truth table. 11. Define the term dont care terms.. 12. What is pairs and quads in karnaugh mapping? 13. Write a note on :General form of a method declaration. SECTION -B ANSWER ANY FIVE QUESTIONS 5x5 = 25

14. What is a computer language? Mention different language types. 15. State any five laws of Boolean Alegbra. 16. Prove that(A+B)(A+Bc)=A+BC using truth table. 17. What is Gray Code? Write it uses.. 18. Simplify using K map : F(A,B,C,D)= (0,1,3,5,7,9,11,12,13,14,15). 19. Simplify the K map f(A,B,C,D0= (3,4,6,7,11,12,13,14,15). 20. Simplify the Boolean function F(A,B,C) in sum of products using dont care conditions d F=B+AC d=BC+AB. SECTION -C ANSWER ANY THREE QUESTIONS
21. Explain the different generations of computers.

3 x 10 = 30

22. Explain the following logic gates with truth tables AND, OR, NOT,XOR. 23. State and prove Demorgans theorem. 24. Design a circuit to convert 4-bit binary to its equivalent Gray code. 25. Define five variablr K-map.Simplify the Boolean function F(A,B,C,D,E)= (0,2,4,6,9,13,21,23,25,29,31).