Scribd Logo
Upload

Welcome to Scribd!

  • 22 views

    Home Asgn2 BSCS-12ABC

    Uploaded by

    Hira Sardar
    This document provides the details for Home Assignment No. 2 in the course BSCS-12ABC Digital Logic Design. It includes 3 problems to solve related to simplifying Boolean expressions, reducing a function to a given number of literals, and analyzing a logic circuit. Students must show their work, include page numbers in an index, and certify their work as original. Late submissions without approval will not be accepted.

    Copyright:

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

    Home Asgn2 BSCS-12ABC

    Uploaded by

    Hira Sardar
    22 views2 pages
    This document provides the details for Home Assignment No. 2 in the course BSCS-12ABC Digital Logic Design. It includes 3 problems to solve related to simplifying Boolean expressions, reducing a function to a given number of literals, and analyzing a logic circuit. Students must show their work, include page numbers in an index, and certify their work as original. Late submissions without approval will not be accepted.

    Original Description:

    home assignment dld.

    Original Title

    home_asgn2_BSCS-12ABC

    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 provides the details for Home Assignment No. 2 in the course BSCS-12ABC Digital Logic Design. It includes 3 problems to solve related to simplifying Boolean expressions, reducing a function to a given number of literals, and analyzing a logic circuit. Students must show their work, include page numbers in an index, and certify their work as original. Late submissions without approval will not be accepted.

    Copyright:

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

    Home Asgn2 BSCS-12ABC

    Uploaded by

    Hira Sardar
    This document provides the details for Home Assignment No. 2 in the course BSCS-12ABC Digital Logic Design. It includes 3 problems to solve related to simplifying Boolean expressions, reducing a function to a given number of literals, and analyzing a logic circuit. Students must show their work, include page numbers in an index, and certify their work as original. Late submissions without approval will not be accepted.

    Copyright:

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

    School of Electrical Engineering and Computer Science

    National University of Sciences & Technology (NUST)

    Home Assignment No-2 (CLO-2)


    Subject: Digital Logic Design Marks: 50
    Course: BSCS-12ABC Issue: 02 Mar 2023
    Teacher: Engr. Arshad Nazir Due: 09 Mar 2023
    Note: (11:00 AM)

     Attempt the given problem set in a sequential order. Show all the design steps.
     Make an index showing summary of the problems solved with page numbers and
    also specify the missing ones.
     No late submissions will be accepted unless a prior approval from the teacher is
    obtained with extremely genuine reasons. The assignments submitted after the
    due date/time will be graded zero.
     University has zero tolerance for plagiarism and serious penalties apply. All
    assignments found mutually copied will be marked zero.
     The students will submit a certificate with the assignment work stating the
    originality of their efforts and no copying from others.
     FIVE marks are reserved for neat and clean work, table of contents, and
    certificate to be attached with the assignment work.
    ______________________________________________________________________

    Problem No-1 Simplify each expression by algebraic manipulation. Try to recognize when it
    is appropriate to transform to the dual, simplify, and retransform:

    a. a′.0=
    b. a+a′b=
    c. (x+z)(x′+y)(y+z)=
    d. x′+yx′=
    e. w+[w+(wx)]=
    f. w′(wxyz)′=
    g. (x′+x′)′=
    h. x≡xy=
    i. f[a,b,(ab)′]=
    j. f[a,b,ab]=
    For i and j, use f(a,b,c)=a+b+c

    Problem No-2 Apply postulates and theorems of Boolean algebra to reduce the given
    function to the indicated number of literals:-

    F(A,B,C,D,E)=
    ABC+ABD+ABE+ACD+ACE+(A+D+E)΄+B΄C΄D+B΄C΄E+B΄D΄E΄+C΄D΄E΄ to
    five literals
    Problem No-3 Write the simplified output Boolean expression X for the circuit of Figure P3
    and use it to determine the complete truth table. Then apply the waveform
    sketched below to the circuit inputs, and draw the resulting output waveform
    without gate delays. Express the function in sum-of-minterms (SSOP) and
    product-of-maxterms (SPOS) in both short notation and algebraic forms.

    Figure P3 Logic Circuit and input waveforms


    _____________________________________________________________________
    “Good Luck”

    You might also like