Scribd Logo
Upload

Welcome to Scribd!

  • 1 views

    assignment_1719572914

    Uploaded by

    mussolinib002

    Copyright:

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

    assignment_1719572914

    Uploaded by

    mussolinib002
    1 views18 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    1 views18 pages

    assignment_1719572914

    Uploaded by

    mussolinib002

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    of 18

    CHAPTER-3 BOOLEAN LOGIC

    UNIT - 1 (comprises CH1,CH2, CH3)


    Weightage of UNIT-1 : 10 out of 70 marks
    SYLLABUS FOR CHAPTER-3 BOOLEAN LOGIC

    ● Boolean logic: NOT, AND, OR, NAND, NOR, XOR, NOT, truth tables

    ● De Morgan’s laws,

    ● Logic circuits
    QUESTION-1 What is logic gate?

    Logic gate is an electronic component


    which operates on one (or) more input signals and always produces only one output signal
    QUESTION-2 List out the 3 basic logic gates.

    OR gate
    AND gate
    NOT gate
    QUESTION-3 List out the 3 derived gates.

    NOR gate
    NAND gate
    XOR gate
    QUESTION-4
    Write the symbol for OR gate, AND gate and NOT
    gate.

    + is OR operator
    QUESTION-5
    Draw the truth table for OR gate, AND gate and NOT gate.
    Truth Table for OR Gate (X+Y)

    X Y X+Y(OR gate will return 1


    when any one of the i/p is 1)

    0 0 0
    0 1 1
    1 0 1
    1 1 1
    Truth Table for NOT gate(X’)

    X X’

    0 1 Truth Table for AND gate(X.Y)

    1 0 X Y X.Y(AND gate will


    return 1 only when
    both the inputs are 1)

    0 0 0

    0 1 0

    1 0 0

    1 1 1
    Q6. State DeMorgan’s Law and verify it using Truth Table

    DeMorgan’s Law:
    _____
    X+Y = X’ . Y’

    _____
    X.Y = X’ + Y’

    LHS RHS
    Verification for FIRST DEMORGAN’S LAW:
    ____
    X Y X+Y X+Y X’ Y’ X’.Y’
    LHS=RHS
    0 0 0 1 1 1 1 Thus verified
    0 1 1 0 1 0 0

    1 0 1 0 0 1 0

    1 1 1 0 0 0 0
    QUESTION-7
    Which basic gate is also called as inverter?
    Ans: NOT gate
    QUESTION-8
    _______ gate is called as inverted OR gate.
    ________ gate is called as inverted AND gate.
    ________ gate is called as exclusive OR gate.

    Ans:
    NOR gate
    NAND gate
    XOR gate
    QUESTION-9
    Why NAND and NOR gates are called as
    Universal gates?

    Because using NAND and NOR gates,


    we can design all the other gates
    QUESTION-10
    Write the symbol for NOR gate, NAND gate and XOR
    gate
    QUESTION-11
    Draw the truth table for NOR gate, NAND gate and XOR gate.
    OR gate
    Ans:
    _ XOR
    NOR gate expression is A+B gate
    A B A+B
    _
    NOR gate expression is A.B 0 0 0 0

    0 1 1 1
    XOR gate expression is
    1 0 1 1

    1 1 1 0
    QUESTION-12
    Prepare a truth table for following: a) AB’+B’A
    b) A + 1
    c) A + A’
    d) AB’+C’

    a) Truth table for AB’ + B’A

    A B B’ A.B’ B’.A A.B’ + B’.A

    0 0 1 0 0 0

    0 1 0 1 1 1

    1 0 1 1 1 1

    1 1 0 0 0 0
    b) Truth table for A+1 c) Truth table for A+A’ d) Truth table for AB’ +C’

    A 1 A+1 A B C B’ A.B’ A.B’ + C


    A A’ A+A’

    0 1 1 0 0 0 1 0 0
    0 1 1
    1 1 1 0 0 1 1 0 1
    1 0 1
    0 1 0 0 0 0

    0 1 1 0 0 1

    1 0 0 1 1 1

    1 0 1 1 1 1

    1 1 0 0 0 0

    1 1 1 0 0 1
    QUESTION-13
    Draw the logical circuits for :
    a) AB’+C’
    b) P’Q’ + R
    a) (A’+B’)+(CD)’

    You might also like