Scribd Logo
Upload

Welcome to Scribd!

  • Assignment 2

    Uploaded by

    baba khan
    6 views2 pages
    The document is an assignment for a Digital Logic Design course given at Air University - Aerospace and Aviation Campus in Kamra, Pakistan. It contains 5 questions related to logic gates, Boolean expressions, DeMorgan's theorems, and canonical forms. Students are asked to identify logic gates from their truth tables, write Boolean expressions for a logic gate circuit, simplify expressions using DeMorgan's theorems, obtain truth tables and write functions in sum-of-products and product-of-sums forms, and change a function between canonical forms. The assignment is worth a total of 45 marks.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document is an assignment for a Digital Logic Design course given at Air University - Aerospace and Aviation Campus in Kamra, Pakistan. It contains 5 questions related to logic gates, Boolean expressions, DeMorgan's theorems, and canonical forms. Students are asked to identify logic gates from their truth tables, write Boolean expressions for a logic gate circuit, simplify expressions using DeMorgan's theorems, obtain truth tables and write functions in sum-of-products and product-of-sums forms, and change a function between canonical forms. The assignment is worth a total of 45 marks.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views2 pages

    Assignment 2

    Uploaded by

    baba khan
    The document is an assignment for a Digital Logic Design course given at Air University - Aerospace and Aviation Campus in Kamra, Pakistan. It contains 5 questions related to logic gates, Boolean expressions, DeMorgan's theorems, and canonical forms. Students are asked to identify logic gates from their truth tables, write Boolean expressions for a logic gate circuit, simplify expressions using DeMorgan's theorems, obtain truth tables and write functions in sum-of-products and product-of-sums forms, and change a function between canonical forms. The assignment is worth a total of 45 marks.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Air University - Aerospace and Aviation Campus,

    Kamra
    Department of Electrical Engineering
    Assignment # 02
    Course: Digital Logic Design (EE-223) Semester: Fall 2023
    Date: 16th October. 2023 Total Marks: 45

    [CLO 2, PLO 2, Taxonomy Level C3]


    _________________________________________________________________________________

    Attempt all questions.


    Q 1. Identify each of these logic gates by name, and complete their respective truth tables

    (10pts)

    1
    Q 2. Change the following logic gate circuit into a Boolean expression. Write Boolean
    subexpression next to each gate.
    (10pts)

    Q.3.Use DeMorgan’s Theorems to simplify the following expressions


    (5Pts)
    ' ' ' '
    F=(B¿¿ ' D)( A +C D)+(B C + D A)¿

    Q.4 Obtain the truth table of the following functions, and express each function in sum - of
    minterms and product of maxterms form:
    (10pts)
    ' ' ' ' '
    F=bd +ac d + a b c + a c

    Q.5 Change the following to the other canonical form:


    (10pts)
    F=∈(2 ,3 ,5 , 6)
    F=π ¿)

    You might also like