Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    DSD Previous Year Questions

    Uploaded by

    21vishnuvp
    This document contains 33 questions related to digital system design topics such as binary, octal, hexadecimal number conversion, Boolean algebra, Karnaugh maps, adders, multiplexers, decoders, codes and comparators.

    Copyright:

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

    DSD Previous Year Questions

    Uploaded by

    21vishnuvp
    7 views2 pages
    This document contains 33 questions related to digital system design topics such as binary, octal, hexadecimal number conversion, Boolean algebra, Karnaugh maps, adders, multiplexers, decoders, codes and comparators.

    Original Title

    DSD Previous year questions

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains 33 questions related to digital system design topics such as binary, octal, hexadecimal number conversion, Boolean algebra, Karnaugh maps, adders, multiplexers, decoders, codes and comparators.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    7 views2 pages

    DSD Previous Year Questions

    Uploaded by

    21vishnuvp
    This document contains 33 questions related to digital system design topics such as binary, octal, hexadecimal number conversion, Boolean algebra, Karnaugh maps, adders, multiplexers, decoders, codes and comparators.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    DSD Previous year questions

    1. Convert (504.75)10 to binary, octal and hexadecimal number systems.


    2. Calculate the following using BCD arithmetic
    a. 0111 1000 + 0101 0110
    b. 0100 0101 - 0100 1001
    3. Compare 1’s and 2’s complement methods of representations.
    4. Using K-map minimize the given Boolean function F=A’B’D’+A’CD+A’BC and
    d=A’BC’D+ACD+AB’D’
    5. List the postulates of Boolean algebra.
    6. Using K-map simplify following Boolean expression & implement
    the same using gates F(A,B,C,D) =Σm(2,4,8,15)+ Σd(0,3,9,12)
    7. Find the complement of the Boolean function F = A̅ + ABC̅.
    And prove that F + F̅ = 1 and F. F̅ = 0.
    8. Write notes on character coding schemes.
    9. Minimize the following expression using K-map.
    F(w,x,y,z) = Π (0,1,2,3,4,10,11)
    10. Explain a 4-bit carry look ahead adder with neat diagram.
    11. Demonstrate a 4 x 1Multiplexer and 1 x 4 Demultiplexer with neat diagram.
    12. Convert (84.25)10 to binary, octal and hexadecimal.
    13. Perform subtraction using r’s complement of the subtrahend of :(5A.36)16 – (201.24)16
    14. Determine the base of the numbers in the operation; 24 + 17 = 40.
    15. Represent the decimal number 3581 in BCD, Excess-3 code, 2421 code, 6311
    16. code, and 84-2-1 code.
    17. What is a prime implicant? What is an essential prime implicant? Give an Example to
    distinguish between prime implicant and essential prime implicant.
    18. Represent the unsigned decimal numbers 572.36 and 687.73in BCD. Show the
    necessary steps to perform the sum of these BCD numbers.
    19.

    20. Design a full adder. Using full adders implement a 4- bit adder-subtractor circuit.
    21. Perform subtraction using 2’s complement of the subtrahend of 1100.101 – 101.1011
    22. Determine the base of the numbers in the operation; 58/4= 15
    23. Prove that A+A̅B = A + B using Boolean postulates.
    24. Find the complement of the Boolean function F = A̅ + ABC̅.And prove that F + F̅ = 1
    and F. F̅ = 0.
    25.

    26. Represent (+59) and (-31) as signed binary numbers using 2’s complement
    representation enough digits to accommodate the numbers. Perform the addition of
    these signed binary numbers.
    27. Design a look ahead carry generator to add two four-bit binary data input
    28. Simplify the following functions using Quine- McClusky method : f (a,b,c,d) = ∑m (2,
    3, 4, 5, 13, 15) + ∑d (8, 9, 10, 11).
    29. Design a 4-bit code-converter to convert BCD to gray code.
    30. Simplify the following Boolean function into (i) sum-of-products form and (ii)
    product-of-sums form:
    F (A, B, C, D) = ∑m(0, 1, 2, 5, 8, 9, 10)
    31. Simplify the following functions using Quine- McClusky method :
    F (w,x,y,z) = ∑m(3,4,5,6,7,11,12,14,15)
    32. Using K-map simplify following Boolean expressions & give implementation of same
    using gates
    F(A,B,C,D)=AB(C+D)+ A̅(B+C+BCD)
    d(A,B,C,D)= 𝐴 𝐵 𝐶 + 𝐴𝐵𝐶 𝐷 + 𝐴 𝐵 𝐶
    33. Derive the circuit for two bit magnitude comparator

    You might also like