Scribd Logo
Încărcați

Bine ați venit la Scribd!

  • Section 2 Tutorial 1

    Încărcat de

    kesna
    30 vizualizări1 pagină
    This document provides instructions on digital electronics tasks: 1) Sketch the output waveform for a decoding logic circuit given an input waveform. 2) Simplify logic expressions using De Morgan's theorem. 3) Implement the simplest logic circuit for a truth table using a Karnaugh map. 4) Write Boolean expressions for two logic circuits shown.

    Descriere originală:

    uwi

    Drepturi de autor

    © © All Rights Reserved

    Formate disponibile

    PDF, TXT sau citiți online pe Scribd

    Vi se pare util acest document?

    Este necorespunzător acest conținut?

    Raportați acest document
    This document provides instructions on digital electronics tasks: 1) Sketch the output waveform for a decoding logic circuit given an input waveform. 2) Simplify logic expressions using De Morgan's theorem. 3) Implement the simplest logic circuit for a truth table using a Karnaugh map. 4) Write Boolean expressions for two logic circuits shown.

    Drepturi de autor:

    © All Rights Reserved
    Descărcați ca PDF, TXT sau citiți online pe Scribd
    Indicator pentru conținut neadecvat
    30 vizualizări1 pagină

    Section 2 Tutorial 1

    Încărcat de

    kesna
    This document provides instructions on digital electronics tasks: 1) Sketch the output waveform for a decoding logic circuit given an input waveform. 2) Simplify logic expressions using De Morgan's theorem. 3) Implement the simplest logic circuit for a truth table using a Karnaugh map. 4) Write Boolean expressions for two logic circuits shown.

    Drepturi de autor:

    © All Rights Reserved
    Descărcați ca PDF, TXT sau citiți online pe Scribd
    Indicator pentru conținut neadecvat
    din 1

    Section 2: Digital Electronics: Tutorial 1

    1. If the input waveform (as shown) is applied to the decoding logic circuit, sketch the output waveform
    in proper relation to the inputs.

    2. Apply De Morgan’s theorem to simplify the following logic expressions:

    ( A B) C ( A B) CD ( A B)C D E F

    3. Implement (draw circuit) the simplest logic circuit for this truth table (hint: use Karnaugh Map to
    simplify):

    4. Write the Boolean expressions for the circuits below:

    (a) (b)

    S-ar putea să vă placă și