Scribd Logo
Upload

Welcome to Scribd!

  • 12 views

    Logic Gates

    Uploaded by

    sagnik.143.2027
    Notes of logic gates for IGCSE Computer Science

    Copyright:

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

    Logic Gates

    Uploaded by

    sagnik.143.2027
    12 views35 pages
    Notes of logic gates for IGCSE Computer Science

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Notes of logic gates for IGCSE Computer Science

    Copyright:

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

    Logic Gates

    Uploaded by

    sagnik.143.2027
    Notes of logic gates for IGCSE Computer Science

    Copyright:

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

    Logic gates

    0 1
    HARSHAL GUNWANT
    IGCSE
    Syllabus
    Digital Computers

    Imply that the computer deals with digital information, i.e., it


    deals with the information that is represented by binary digits

    Binary Digital Input Signal Gate Binary Digital Output Signal


    What are logic gates?

     Elementary building blocks of a digital circuit


     Most logic gates have two input and one output

     All digital computers have been constructed using the same type of components called
    logic gates.
     The functions of logic gates can be manipulated using a branch of mathematics
    called Boolean Algebra, invented by the mathematician George Boole 150 years ago
     Using transistors we can create basic logic gates that performs Boolean operation on high
    and low signals
    Basic Logic Operators

     AND
    Binary
     OR
     NOT Unary
    NOT GATE
    AND GATE
    OR GATE
    NAND GATE (AND gate followed by
    NOT)
    NOR GATE (OR gate followed by NOT)
    XOR (Exclusive-OR) Gate

     Inclusive vs. exclusive


     The output of an Exclusive-OR gate ONLY goes “HIGH” when its two input terminals are at
    “DIFFERENT” logic levels with respect to each other.
     Only one input is allowed to be positive (1 or ON) to give a positive output (1). If both inputs are
    positive (1) then there is a negative outcome (0, or OFF).

    More on XOR
    Summary
    Logic circuits (Book and
    Past year questions)
    Note: A is 1/ON/TRUE represents that the circuit is ON and A is
    0/OFF/FALSE indicates that the circuit is OFF
    Question type-1

    Produce a truth table for the following logic circuit

    Note: There are three inputs to this logic circuit, therefore there will be
    eight possible binary values which can be input.
    Solution (step 1)

     This is the first part of the logic circuit; the first task is to find the intermediate values P and
    Q.
    Solution (step 2)

     The second part of the logic circuit has P and Q as inputs and the intermediate output, R:
    Solution (Step 3)
     The final part of the logic circuit has R and C as inputs and the final output, X:
     This gives the third intermediate truth table
    Solution (final step)
    Solution (final step)

    • Note: There The intermediate values can be left out of the final truth table, but it is
    good practice to leave them in until you become confident about producing the
    Find out the Truth table and Boolean
    expression of the logic circuit below
    Find out the Truth table and Boolean
    expression of the logic circuit below

    A B C
    Question type-2 [Most asked question
    type]
    Interpretation of the problem

    This statement can also be written in Boolean algebra as:

    (AB’)+(BC’)
    Final Solution
    March-2019 series
    March-2019 series
    March-2019 series
    March-2019 series
    BOOLEAN ALGEBRA
    Additional notes UNIVERSAL GATES
    Boolean Laws

    Commutative law Associative law


     A.B = B.A  (A.B).C = A.(B.C)
     A+B = B+A  (A+B)+C = A+(B+C)
    Boolean Laws

    Distributive law Inversion law


     A.(B+C) = A.B+A.C  (A’)’ = A
    De Morgan’s theorems
    De Morgan’s theorems
    Universal Gates

     A universal gate is a gate which can implement any Boolean function


    without need to use any other gate type.
     The NAND and NOR gates are universal gates

    More details posted in the Google Classroom……!!!!

    You might also like