Scribd Logo
Upload

Welcome to Scribd!

  • 170 views

    Lab Experiment ME 12

    Uploaded by

    Muhammad Arslan
    The document describes Lab Experiment #12 which aims to implement and verify Boolean algebraic laws using logic gates. It discusses the basic logic gates - AND, OR, NOT - and their truth tables. It also outlines several Boolean algebraic laws like distributive, identity, inverse, and idempotent laws. The lab tasks involve using logic gates to diagrammatically represent these laws and verify the output truth tables match the expected ones based on the laws. The conclusion is that logic gates can be used as switches, inverters, and to implement Boolean identities in digital electronics applications.

    Copyright:

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

    Lab Experiment ME 12

    Uploaded by

    Muhammad Arslan
    170 views7 pages
    The document describes Lab Experiment #12 which aims to implement and verify Boolean algebraic laws using logic gates. It discusses the basic logic gates - AND, OR, NOT - and their truth tables. It also outlines several Boolean algebraic laws like distributive, identity, inverse, and idempotent laws. The lab tasks involve using logic gates to diagrammatically represent these laws and verify the output truth tables match the expected ones based on the laws. The conclusion is that logic gates can be used as switches, inverters, and to implement Boolean identities in digital electronics applications.

    Original Description:

    hi

    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 describes Lab Experiment #12 which aims to implement and verify Boolean algebraic laws using logic gates. It discusses the basic logic gates - AND, OR, NOT - and their truth tables. It also outlines several Boolean algebraic laws like distributive, identity, inverse, and idempotent laws. The lab tasks involve using logic gates to diagrammatically represent these laws and verify the output truth tables match the expected ones based on the laws. The conclusion is that logic gates can be used as switches, inverters, and to implement Boolean identities in digital electronics applications.

    Copyright:

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

    Lab Experiment ME 12

    Uploaded by

    Muhammad Arslan
    The document describes Lab Experiment #12 which aims to implement and verify Boolean algebraic laws using logic gates. It discusses the basic logic gates - AND, OR, NOT - and their truth tables. It also outlines several Boolean algebraic laws like distributive, identity, inverse, and idempotent laws. The lab tasks involve using logic gates to diagrammatically represent these laws and verify the output truth tables match the expected ones based on the laws. The conclusion is that logic gates can be used as switches, inverters, and to implement Boolean identities in digital electronics applications.

    Copyright:

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

    EE-301 Lab Manual, ME Department, Wah Engineering College

    Lab Experiment # 12
    Implementation and verification of Boolean algebraic laws using logic gates

    Objective: To implement and verify Boolean algebraic laws by using logic gates.

    Apparatus:

    AND Gate
    OR Gate
    NOT Gate
    Oscilloscope
    Function generator
    THEORY:

    LOGIC GATES:
    A logic gate is an elementary building block of a digital circuit. Most logic gates have two inputs
    and one output. At any given moment, every terminal is in one of the two binary
    conditions low (0) or high (1), represented by different voltage levels. The logic state of a
    terminal can, and generally does, change often, as the circuit processes data. In most logic gates,
    the low state is approximately zero volts (0 V), while the high state is approximately five volts
    positive (+5 V).

    There are seven basic logic gates: AND, OR, XOR, NOT, NAND, NOR, and XNOR.

    We used:

    1. AND GATE:
    The AND gate is so named because, if 0 is called "false" and 1 is called "true," the gate acts
    in the same way as the logical "and" operator. The following illustration and table show the
    circuit symbol and logic combinations for an AND gate. (In the symbol, the input terminals
    are at left and the output terminal is at right.) The output is "true" when both inputs are
    "true." Otherwise, the output is "false."

    Figure-1 AND gate symbol


    EE-301 Lab Manual, ME Department, Wah Engineering College

    Input 1 Input 2 Output

    0 0 0

    0 1 0

    1 0 0

    1 1 1

    Table-1

    2. OR GATE:
    The OR gate gets its name from the fact that it behaves after the fashion of the logical
    inclusive "or." The output is "true" if either or both of the inputs are "true." If both inputs
    are "false," then the output is "false."

    Figure-2 OR gate Symbol

    Input 1 Input 2 Output

    0 0 0

    0 1 1

    1 0 1

    1 1 1

    3. NOT GATE:
    A logical inverter, sometimes called a NOT gate to differentiate it from other types of
    electronic inverter devices, has only one input. It reverses the logic state.

    Figure-3 NOT gate Symbol


    EE-301 Lab Manual, ME Department, Wah Engineering College

    Input Output

    1 0

    0 1

    Table-3

    BASIC IDENTITIES OF BOOLEAN ALGEBRA:


    There are several laws and properties of Boolean algebra similar to the linear algebra.
    These laws can be verified through the Boolean operators. These operators are AND gate,
    OR gate and NOT gate. the laws are as follow:
    1. Commutative law:

    A + B = B+A A . B = B. A

    2. Distributive law:

    A+(B . C) = (A+B) . (B+C) A.(B+C) = (A . B)+(A . C)

    3. Associate law:
    (A+B)+C = A+(B+C) (A . B) . C = A. (B. C)

    4. Inverse law:
    A. = 0 A+=1

    5. Identity law:

    A+0=A A.1=A

    6. Null Law:

    A+1=1 A.0=0

    7. Idempotent law:

    A+A=A A. A = A

    8. Compliment law:

    A + A' = 1 A . A'=0
    EE-301 Lab Manual, ME Department, Wah Engineering College

    These laws can be implemented using the Boolean Operators which are And, OR and NOT
    gates.
    1. Distributive law ( A+(B . C) = (A+B) . (B+C):

    Diagrammatic Representation
    2. Idempotent law:
    Idempotent law For OR (A + A =A):

    Inverse law for OR (A + = 1):

    where A= 0,1
    3. Identity law:
    Law of Identity for AND ( A.1 = A):
    EE-301 Lab Manual, ME Department, Wah Engineering College

    where a = 0,1
    Law of Identity for OR (A+0 = A):

    Diagrammatic
    Representation

    TASKS PERFORMED:

    Distributive law:

    Figure-4 Circuit diagram


    EE-301 Lab Manual, ME Department, Wah Engineering College

    Figure-5 Circuit diagram

    RESULT:
    A B C Y Z
    0 0 0 0 0
    0 0 1 0 0
    0 1 0 0 0
    0 1 1 1 1
    1 0 0 1 1
    1 0 1 1 1
    1 1 0 1 1
    1 1 1 1 1
    Table-1
    TASK # 3

    Inverse Law:

    Figure-6 Circuit diagram


    EE-301 Lab Manual, ME Department, Wah Engineering College

    Identity law:

    Figure-7 Circuit diagram

    Idempotent Law:

    Figure-8 Circuit diagram

    Conclusion:
    Logic gates can be used as switches
    Logic gates can be used to invert the input
    Logic gates are used in digital electronics
    Boolean identities can b used to get the desired output

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy