ASSIGNMENT -1

Note down the Assignment Questions and find out the answers. Write the Question and Answer in A4 sheet and submit on or before 09.02.2015. without fail.

1. Realize OR gate using NAND gate.
2. Convert the (153.513)10 to Octal.
3. Define the following: minterm and maxterm
4. State and prove Consensus theorem
5. Given the two binary numbers X=1010100 and Y=1000011, perform the subtraction                     (a) X-Y and (b) Y-X using 2’s complements 
6. What is the abbreviation of ASCII and EBCDIC code
7. State the sequence of operator precedence in Boolean expression?
8.  What is the advantage of gray codes over the binary number sequence?
9. Perform 9’s and 10’s compliment subtraction between 18 and -24
10. Simplify the following Boolean expression to a minimum number of literals:
    A'B' + A'C' D' + A' B' D + A' B' C D'
11. Simplify the expression ((AB'+ABC)'+A(B+AB'))'
12. Define the following terms: prime implicant, essential prime implicant 
13. What is the limitation of Karnaugh map?
14. Simplify (x+y) (x+y' ) to a minimum number of literals
15.  Convert (367)10 into Excess - 3 code 
16. What is the largest binary number that can be expressed with 12 bits? What is the equivalent decimal and hexadecimal?
17. Find the octal equivalent of hexadecimal number AB.CD
18. Find the minterm of xy+yz+xy' z 
19. Simplify the following Boolean function by Karnaugh map method:       F(A, B, C, D) = Σm(1, 5, 9, 12, 13, 15)
20. Simplify the following Boolean functions to a minimum number of literals 
    (a) (x + y)(x + y′) (b) xy + x′z + yz