Scribd Logo
Upload

Welcome to Scribd!

  • 22 views

    Spring 2024 - CS302P - 1

    Uploaded by

    itsmuhammadtalha787
    The document provides instructions for a digital logic design assignment asking students to simplify a Boolean expression and submit the simplified expression and a NAND-based circuit diagram by analyzing lab experiments covering digital logic circuits, Boolean algebra, and simplification of Boolean expressions.

    Copyright:

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

    Spring 2024 - CS302P - 1

    Uploaded by

    itsmuhammadtalha787
    22 views2 pages
    The document provides instructions for a digital logic design assignment asking students to simplify a Boolean expression and submit the simplified expression and a NAND-based circuit diagram by analyzing lab experiments covering digital logic circuits, Boolean algebra, and simplification of Boolean expressions.

    Original Description:

    my very own assignemnet

    Original Title

    Spring 2024_CS302P_1

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document provides instructions for a digital logic design assignment asking students to simplify a Boolean expression and submit the simplified expression and a NAND-based circuit diagram by analyzing lab experiments covering digital logic circuits, Boolean algebra, and simplification of Boolean expressions.

    Copyright:

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

    Spring 2024 - CS302P - 1

    Uploaded by

    itsmuhammadtalha787
    The document provides instructions for a digital logic design assignment asking students to simplify a Boolean expression and submit the simplified expression and a NAND-based circuit diagram by analyzing lab experiments covering digital logic circuits, Boolean algebra, and simplification of Boolean expressions.

    Copyright:

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

    Digital Logic Design Practicals (CS302P) Total marks = 20

    Assignment # 01 Deadline
    st
    1 of May 2024
    Spring 2024

    Please carefully read the following instructions before attempting the assignment.

    RULES FOR MARKING


    It should be clear that your assignment would not get any credit if:
     The assignment is submitted after the due date.
     The submitted assignment does not open, or the file is corrupted.
     Strict action will be taken if the submitted solution is copied from any other student or the
    internet.

    You should consult the recommended books to clarify your concepts, as handouts are insufficient.
    You are supposed to submit your assignment in Doc or Docx format.
    Any other formats like scanned images, PDF, ZIP, RAR, PPT, BMP, etc. will not be accepted.

    Topic Covered:
    The objective of this assignment is to assess the understanding of students about:
     Lab Work - Week # 03 - Digital logic circuits analysis and converting Boolean expressions to
    digital circuits
     Lab Work - Week # 04 - Boolean Algebra and Simplification of Boolean Expressions

    Topic Covered
    Lab Experiment # 01 to Lab Experiment # 04

    NOTE

    No assignment will be accepted via email after the due date (whether it is due to load shedding, internet
    malfunctioning, etc.). Hence, refrain from uploading assignments within the last hour of the deadline. It is
    recommended that the solution be uploaded at least two days before its closing date.

    If you find any mistakes or confusion in the assignment (Question statement), please consult your instructor
    before the deadline. After the deadline, no queries will be entertained in this regard.

    For any query, feel free to email me at:


    [email protected]
    Question No 01 Marks (20)
    Simplify the Boolean Expression using Logic Converter in Electronic WorkBench. Submit the simplified
    Boolean Expression as well as the NAND-based Simplified circuit diagram.
    ' ' ' ' ' ' ' ' ' '
    A B C H + E F G H + AC E FG +G H + E F GH

    Note: You must attach the screenshot from the Electronics WorkBench showing your NAND-Based
    Simplified Diagram with the Image of the Logic Converter as well.

    You might also like