Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 4 views

    2 DLD

    Uploaded by

    sravan

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    2 DLD

    Uploaded by

    sravan
    4 views1 page

    Original Title

    2.DLD

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    4 views1 page

    2 DLD

    Uploaded by

    sravan

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 1

    1.

    Convert the given decimal number 234 to binary, quaternary, octal, hexadecimal and
    BCD equivalent.
    2. Perform the following
    a) Subtraction by using 10’s complement for the given 3456 - 245.
    b) Subtraction by using 2’s complement for the given 111001-1010.
    3. a) Convert the following to Decimal and then to Octal. (i) (42341)6 (ii) (10010011)2.
    b) Convert the following to Decimal and then to Hexadecimal. ( i) (1234)8 (ii)
    110011112
    4. Simplify the following Boolean expression:
    (a) F = (A+B)(A’+C)(B+C).
    (b) F = A+B+C’+D(E+F)
    5. a) Obtain the truth table of the following Boolean function and express the function
    as sum of minterms and product of maxterms F = (A+B) (B+C)
    b) Simplify the following Boolean functions to minimum number of literals
    (i) xyz + x’y + xyz’. (ii) xz + x’yz.
    6. Convert the following to Decimal and then to Octal
    (a) 123416 (b) 12EF16 (c) 101100112 (d) 100011112 (e) 35210
    (f) 99910
    7. a) Simplify the following Boolean expressions to minimum no. of literals.
    i. ABC+A’B+ABC’ ii. (BC’+A’D)(AB’+CD’)
    iii. x’yz+xz iv. xy+x(wz+wz’)
    b) Obtain the Dual of the following Boolean expressions.
    i. AB+A(B+C)+B’(B+D) ii. A+B+A‘B’C
    iii. A’B+A’BC’+A’BCD+A’BC’D’E iv. ABEF+ABE’F’+A’B’EF
    8. (a) State Duality theorem. List Boolean laws and their Duals.
    (b) Simplify the following Boolean functions to minimum number of literals:
    i. F = ABC + ABC’ + A’B ii. F = (A+B)’ (A’+B’)
    9. a) Convert the following to binary and then to gray code.
    (i) (1111)16 (ii) (BC54)16 (iii) (237)8 (iv) (164)10 (v) (323)8
    b) Perform the following using BCD arithmetic
    (i) (79)10 + (177)10 (ii) (481)10 + (178)10
    10. Convert the following to gray code and then to binary.
    (a) (1111)16 (b) (BC54)16 (c) (237)8 (d) (164)10 (e) (32

    You might also like