Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 40 views

    Digital Circuits

    Uploaded by

    Shahriar Kayes
    The document appears to be a term paper submitted by a student named Md. Shahriar Kayes to his professor Md. Alamgir Mollah. It includes an introduction, table of contents, and sections on basic gates, universal gates, simplifications, truth tables, logic circuits, DeMorgan's theory, K-maps, and flip-flops. It also includes examples of simplifying Boolean expressions and constructing K-maps.

    Copyright:

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

    Digital Circuits

    Uploaded by

    Shahriar Kayes
    40 views15 pages
    The document appears to be a term paper submitted by a student named Md. Shahriar Kayes to his professor Md. Alamgir Mollah. It includes an introduction, table of contents, and sections on basic gates, universal gates, simplifications, truth tables, logic circuits, DeMorgan's theory, K-maps, and flip-flops. It also includes examples of simplifying Boolean expressions and constructing K-maps.

    Original Title

    Digital circuits

    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 appears to be a term paper submitted by a student named Md. Shahriar Kayes to his professor Md. Alamgir Mollah. It includes an introduction, table of contents, and sections on basic gates, universal gates, simplifications, truth tables, logic circuits, DeMorgan's theory, K-maps, and flip-flops. It also includes examples of simplifying Boolean expressions and constructing K-maps.

    Copyright:

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

    Digital Circuits

    Uploaded by

    Shahriar Kayes
    The document appears to be a term paper submitted by a student named Md. Shahriar Kayes to his professor Md. Alamgir Mollah. It includes an introduction, table of contents, and sections on basic gates, universal gates, simplifications, truth tables, logic circuits, DeMorgan's theory, K-maps, and flip-flops. It also includes examples of simplifying Boolean expressions and constructing K-maps.

    Copyright:

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

    Term Paper On

    ………………………………….

    Introduction to Computer

    Course No-MGT-112

    Submitted to:

    Md. Alamgir Mollah

    Assistant professor

    Department of Management Studies

    University of Barisal.

    Submitted By: Md. Shahriar Kayes

    Group Name: INNOVATION

    Batch: 5th

    Department of Management Studies

    University of Barisal

    Submission Date: 20/07/16


    SL Name Roll Marks Marks
    Presentatio Term
    n Paper
    1. Sampa Debnath (GL) 16MGT034

    2. Dristy Saha 16MGT012

    3. Sadia Sultana 16MGT048

    4. Md. Shahriar Kayes 16MGT056

    5. Raziul Alam Mollick 16MGT024

    6. Tazu Sikder 16MGT016

    STUDENTS PROFILE
    Sl. Contents Page
    1 Basic gates 1
    2 Universal gate 4
    3 Simplifications 5
    4 Logic circuits 7
    5 DeMorgans theory 9
    6 K-maps 11
    7 Clock latch 14
    8 JK fliflops 16
    9
    10
    11
    12
    13

    Table of Contents
    Digital circuits

    1) What do you know about Boolean algebra?

    Ans: Boolean algebra deal with binary number system that is very useful
    in designing logic circuit used in processor of computer system. Logic
    circuits can be simplified by Boolean algebra.

    2) Draw the symbol and truth table of two-input OR gate.

    Ans: The symbol and truth table of two-input OR gate has given below;

    B
    Figure 1: OR gate.
    OR Symbol

    Y=A+B

    Truth table;

    3) Explain the operation of folloeing gates:


    AND, NOR, NOT, XOR.

    Ans: AND gate

    Figure 2: AND gate.

    Figure 3: Truth table

    NOT gate;

    Figure 4 : NOT gate.


    Alternative
    Notation
    Y= A’
    Y = !A
    Figure 5 Truth table

    NOR gate;

    Figure 6 : NOR gate.

    Boolean Expression→ Y=A+B= A.B

    Truth table;
    NOR Gate

    Input
    Input 2 Output
    1

    0 0  1

    0  1 0

    1 0  0

    1 1 0

    XOR gate:
    Exclusive OR

    Input 1 Input 2 Output


    Figure 7 : EXOR gate.

    0 0  0 

    0  1 1

    1 0  1

    1 1 0 

    4) What do you understand by basic gae and universal gate?

    Ans: Basic gates: AND , OR and NOT gates are called basic gates. We can realise
    any gates by those gates.

    Universal gate: Throug which gate we can realise all gets that is called universal gate.
    NAND and NOR gates are called universal gate.
    Any logic can be realised by OR, AND, and NOT gates. But it is possible to realize
    any logic circuits by NAND gates only. This is possible because all the logic gates
    can be realised by NAND gates only. Similarly any logic circuits can be realised by
    NOR gates only. This is known as the universality of NAND and NOR gates.

    Figure 8 NAND gate.


    On the figure we saw thal NOT, AND, and OR gates are realised by NAND gate.

    Lesson 2

    Simplificatios

    a) X+XY
    = X(1+Y)

    ´ ´ +Z
    b) WXY
    =WXY
    ´ . Ź
    =WXY. Ź

    c) XY+XZ+ X́ Z +ZX
    =XY+ZX+ZX+ X́ Z
    =X(Y+Z)+Z(X+ X́ )
    =X(Y+Z)+Z

    d) Á BC+A B́C+ABĆ +ABC


    = Á BC+ABC+A B́C+ABC+ABĆ+ABC
    =BC( Á +A)+AC(B+ B́)+AB(C+Ć )
    =BC.1+AC.1+AB.1
    =BC+AC+AB
    ´ ¿¿
    e) ( Á . B́)
    =¿´´¿ ¿
    = Á + B́+Ć + D́
    =A+B+C+D

    g) (A+B)(A+C)
    =AA+AC+AB+BC
    =A+AC+AB+BC
    =A(1+C)+B(A+C)
    =A.1+B(A+C)
    =A+B(A+C)
    Truth Table and Logic Circuits

    2) a.

    Truth table ;

    A B C A+B

    0 0 0 0 1 0

    0 0 1 0 1 1

    0 1 0 1 0 0

    0 1 1 1 0 0

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

    1 1 0 1 0 0

    1 1 1 1 0 0

    DeMorgans theory of four variables

    K-Maps
    K-Maps

    AB 00 01 11 10
    CD
    00 1

    01 1 1 1

    11 1 1

    10

    2.b)
    CD AB 00 01 11 10

    00 1 1
    01
    11 1 1 1
    10 1 1 1

    2.c)

    AB 00 01 11 10
    CD
    00 1 1 1 1

    10 1 1 1 1

    01

    11 1 1 1

    1.a) Draw A clock latch?


    Figure 9 : Clock Latch

    Figure 10 : SR fliflop.
    Figure 11 : JK Fliflop.

    You might also like