Scribd Logo
Upload

Welcome to Scribd!

  • 4 views

    19UPHS04-DIGITAL ELECTRONICS

    Uploaded by

    Mohammed Iqbal

    Copyright:

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

    19UPHS04-DIGITAL ELECTRONICS

    Uploaded by

    Mohammed Iqbal
    4 views2 pages

    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 views2 pages

    19UPHS04-DIGITAL ELECTRONICS

    Uploaded by

    Mohammed Iqbal

    Copyright:

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

    Paavendhar College of Arts and Science, Manivizhundhan South 19UPHS04/08

    Mid Semester Examination – September - 2022 15.09.2022-FN


    III B.Sc. Physics
    DIGITAL ELECTRONICS 9) A+B =B+A and A.B=B.A is called……………
    Marks: 75 (a) Associative law (b) Distributive law
    Duration: 3 Hours (c) Commutative law (d)None of these
    PART A – (15 x 1 = 15 marks) 10) The number of two ones is called……………..
    Answer ALL Questions. (a) Pairs (b) Quads
    1) The octal number (75)8 into its equivalent decimal (c) Octet (d) All of the above
    number________ 11) The output level is not defined is called………….
    (a) 61 (b) 61.1 (a) Don’t care condition
    (c) 61.01 (d) All of the above (b)IncompletelySpecifiedfunction
    2) Convert (ED2)16 into its decimal equivalent……… (c) Don’t care condition
    (a) 3793 (b) 3794 (d) All of the above
    (c) 3795 (d) 3792 12) Y=AC+ABC
    3) DeMorgan’s theorem states that_________ (a) AC (b) AB
    (a) AB= A+ B (b) A + B= A∗B (c) A (d)None of these
    (c) A+ B=A−B (d) AB= A+ B 13) A(B+C) =AB+AC is called……………
    4) Which is the output of AND Gates……………. (a) Associative law (b) Distributive law
    (a) Y=A+B (b) Y=A.B (c) Commutative law (d)None of these
    (c) Y= 0 (d) All of The 14) The don’t care condition is based on …………………
    above (a) Canonical formula (b) Newton
    5) Convert gray to binary (111011)g……………… Formula
    (a) (1011)2 (b) (1111)2 (c) Einstein Formula (d) None of these
    (c) (1000)2 (d) (101101)2 15) The symbol of Don’t care condition………………
    6) How many invalid codes of Excess -3 codes? (a) X (b)d
    (a) 5 (b) 6 (c) Both(a) and (b) (d) None of these
    (c) 2 (d) 16
    7) Convert binary to gray (1011)2
    (a) A AND B (b) A OR B
    (c) A XOR B (d) (1110)g
    8) The Boolean expression Y=A+AB
    (a) A (b) 0
    (c) 1 (d) B
    PART B – (2 x 5 = 10 marks) (b)Simplify Don’t care conditions.
    Answer any TWO Questions. F(A,B,C,D)=Σm(2,3,4,5)+Σd(10,11,12,13,14,15)
    16. Convert interconversion system.
    (i) (52.4)10 to binary
    (ii) (135)8 to binary
    17. Draw the basic logic gates circuits and truth tables.
    18. State and Proof De morgan’s theorem.
    19. Explain Law of Boolean Algebra.
    20. Simplify Boolean ExpressionY= (A+B) (A+C),Y=(A+B+C)
    (A+B)
    Mr. S.Arumugam/Physics
    PART C – (5 x 10 = 50 marks)
    Answer ALL Questions.

    21. (a) Explain how NAND gates can be used as a


    universal gates.
    Or
    (b) Explain how NOR gates can be used as a
    universal gates.
    22. (a) Solve Add 32 and 47 in Excess-3 codes.
    Or
    (b) Solve Add 29 and 49 in Excess - 3 codes.
    23. (a)Simplify theBoolean expression of K-Map in SOP form
    Y= C
    Or
    (b)Simplify K-Map Y=F(A,B,C,D)=Σ(0,1,2,4,5,10,11,14,15)

    24. (a) Simplify K-Map in Boolean expression of POS in Y=D


    Or
    (b) Simplify K-Map in POS F=Σ(1,3,4,6,9,11,12,14)

    25. (a)Simplify Incompletelt specified function.


    F(A,B,C,D)=Σm (1,3,7,11,15)+Σd(0,2,4)
    Or

    You might also like