Scribd Logo
Upload

Welcome to Scribd!

  • 2141302DPSD

    Uploaded by

    devibala7
    14 views1 page
    The document contains a midterm test for a digital principles and system design course. It has multiple choice and long answer questions covering K-maps, logic simplification using K-maps and Quine-McCluskey method, binary and hexadecimal conversions, implementing logic functions with NAND and NOR gates, and universal gates. Students are asked to simplify Boolean expressions, solve logic functions, convert between number bases, plot K-maps, and represent logic with universal gates.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    RTF, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains a midterm test for a digital principles and system design course. It has multiple choice and long answer questions covering K-maps, logic simplification using K-maps and Quine-McCluskey method, binary and hexadecimal conversions, implementing logic functions with NAND and NOR gates, and universal gates. Students are asked to simplify Boolean expressions, solve logic functions, convert between number bases, plot K-maps, and represent logic with universal gates.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as RTF, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    14 views1 page

    2141302DPSD

    Uploaded by

    devibala7
    The document contains a midterm test for a digital principles and system design course. It has multiple choice and long answer questions covering K-maps, logic simplification using K-maps and Quine-McCluskey method, binary and hexadecimal conversions, implementing logic functions with NAND and NOR gates, and universal gates. Students are asked to simplify Boolean expressions, solve logic functions, convert between number bases, plot K-maps, and represent logic with universal gates.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as RTF, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    B

    GANADIPATHY TULSIS JAIN ENGINEERING COLLEGE Department of Electronics and Communication Engineering MID TERM TEST - I 141302-DIGITAL PRINCIPLES AND SYSTEN DESIGN II - IT Year/sem: II/III Date:18/08/2011 Time: 1hr30min Max.marks: 50 =============================================================== PART: A (5 x 2 = 10 Marks) 1.What is the use of k-map? 2 Define prime implicant 3. Convert (A.F3.15)16 to base 10. 4. Plot the following function by using a K-map and determine its minterm and maxterm lists : f=AB+BC. 5.Convert (0.6875)10 to binary. PART: B (40 MARKS) 11. (a) Simplify using K-map and express the reduced expression in SOP and POS form. F = S m (0, 6, 8, 13, 14) + S d (2 , 4, 10) OR 11.(b) Reduce the following Boolean expression i. Y=AB+A(B+C)+B(B+C) ii.Y=(A+B)(A+B) iii.Y=AB+AC+ABC(AB+C) iv.AB+AC+ABC (8) (8)

    12. (a. )Solve the given Boolean function using Quine MC Cluskey method and draw the logic diagram for the reduced expression using only NOR gates. F(A, B, C ,D) = Sm(1,2,3,5,9,12,14,15) + Sd (4,8,11) (16) OR 12. b.Implement the Boolean functions using NAND gates. i.F=AB+CD+E ii.(AB+C)D+EF 13.(a). (a) What are Universal gates? Represent all the gate operations with universal gates. OR 13.b. (b) Simplify the following expression. y =ml+m3 +m4+m5+m8+m9+ml0+mll +mI2+ m14 using (i) Karnaugh map. (ii) Quine Mcluskey method.

    (8) (8) (16)

    (8) (8)

    You might also like