Scribd Logo
Upload

Welcome to Scribd!

  • Series 1 Basic Tools of Combinational Logic

    Uploaded by

    Chelsea Lavonya
    189 views3 pages
    The document outlines a series of exercises involving Boolean algebra, logic gates, truth tables, and Karnaugh maps. The exercises involve writing Boolean equations in sum-of-products and product-of-sums canonical form for given truth tables, minimizing Boolean equations, and sketching combinational logic circuits to implement Boolean functions using gates like AND, OR, NOT, NAND, and NOR.

    Original Description:

    Original Title

    Series 1 Basic tools of combinational logic

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document outlines a series of exercises involving Boolean algebra, logic gates, truth tables, and Karnaugh maps. The exercises involve writing Boolean equations in sum-of-products and product-of-sums canonical form for given truth tables, minimizing Boolean equations, and sketching combinational logic circuits to implement Boolean functions using gates like AND, OR, NOT, NAND, and NOR.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    189 views3 pages

    Series 1 Basic Tools of Combinational Logic

    Uploaded by

    Chelsea Lavonya
    The document outlines a series of exercises involving Boolean algebra, logic gates, truth tables, and Karnaugh maps. The exercises involve writing Boolean equations in sum-of-products and product-of-sums canonical form for given truth tables, minimizing Boolean equations, and sketching combinational logic circuits to implement Boolean functions using gates like AND, OR, NOT, NAND, and NOR.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 3

    Exercises: Boolean algebra, logic gates, truth tables and K-maps

    Exercise 2.1 Write a Boolean equation in sum-of-products canonical form for


    each of the truth tables in Figure 2.80.

    (a) (b) (c) (d) (e)


    A B Y A B C Y A B C Y A B C D Y A B C D Y
    0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0 1
    0 1 0 0 0 1 0 0 0 1 0 0 0 0 1 1 0 0 0 1 0
    1 0 1 0 1 0 0 0 1 0 1 0 0 1 0 1 0 0 1 0 0
    1 1 1 0 1 1 0 0 1 1 0 0 0 1 1 1 0 0 1 1 1
    1 0 0 0 1 0 0 1 0 1 0 0 0 0 1 0 0 0
    1 0 1 0 1 0 1 1 0 1 0 1 0 0 1 0 1 1
    1 1 0 0 1 1 0 0 0 1 1 0 0 0 1 1 0 1
    1 1 1 1 1 1 1 1 0 1 1 1 0 0 1 1 1 0
    1 0 0 0 1 1 0 0 0 0
    1 0 0 1 0 1 0 0 1 1
    1 0 1 0 1 1 0 1 0 1
    1 0 1 1 0 1 0 1 1 0
    1 1 0 0 0 1 1 0 0 1
    1 1 0 1 0 1 1 0 1 0
    1 1 1 0 1 1 1 1 0 0
    1 1 1 1 0 1 1 1 1 1

    Figure 2.80 Truth tables for Exercises 2.1 and 2.3

    Exercise 2.2 Write a Boolean equation in sum-of-products canonical form for


    each of the truth tables in Figure 2.81.

    (a) (b) (c) (d) (e)


    A B Y A B C Y A B C Y A B C D Y A B C D Y
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0
    0 1 1 0 0 1 1 0 0 1 1 0 0 0 1 0 0 0 0 1 0
    1 0 1 0 1 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 0
    1 1 1 0 1 1 1 0 1 1 0 0 0 1 1 1 0 0 1 1 1
    1 0 0 1 1 0 0 0 0 1 0 0 0 0 1 0 0 0
    1 0 1 0 1 0 1 0 0 1 0 1 0 0 1 0 1 0
    1 1 0 1 1 1 0 1 0 1 1 0 1 0 1 1 0 1
    1 1 1 0 1 1 1 1 0 1 1 1 1 0 1 1 1 1
    1 0 0 0 1 1 0 0 0 1
    1 0 0 1 0 1 0 0 1 1
    1 0 1 0 1 1 0 1 0 1
    1 0 1 1 0 1 0 1 1 1
    1 1 0 0 0 1 1 0 0 0
    1 1 0 1 0 1 1 0 1 0
    1 1 1 0 0 1 1 1 0 0
    1 1 1 1 0 1 1 1 1 0

    Figure 2.81 Truth tables for Exercises 2.2 and 2.4


    Exercise 2.3 Write a Boolean equation in product-of-sums canonical form for the
    truth tables in Figure 2.80.

    Exercise 2.4 Write a Boolean equation in product-of-sums canonical form for the
    truth tables in Figure 2.81.

    Exercise 2.5 Minimize each of the Boolean equations from Exercise 2.1.

    Exercise 2.6 Minimize each of the Boolean equations from Exercise 2.2.

    Exercise 2.7 Sketch a reasonably simple combinational circuit implementing each


    of the functions from Exercise 2.5. Reasonably simple means that you are not
    wasteful of gates, but you don’t waste vast amounts of time checking every
    possible implementation of the circuit either.

    Exercise 2.8 Sketch a reasonably simple combinational circuit implementing each


    of the functions from Exercise 2.6.

    Exercise 2.9 Repeat Exercise 2.7 using only NOT gates and AND and OR gates.

    Exercise 2.10 Repeat Exercise 2.8 using only NOT gates and AND and OR gates.

    Exercise 2.11 Repeat Exercise 2.7 using only NOT gates and NAND and NOR
    gates.

    Exercise 2.12 Repeat Exercise 2.8 using only NOT gates and NAND and NOR
    gates.

    Exercise 2.13 Simplify the following Boolean equations using Boolean theorems.
    Check for correctness using a truth table or K-map.

    (a) Y = AC + A BC

    (b) Y = A B + ABC + ðA + C Þ
    (c) Y = A B C D + AB C + ABCD + ABD + A BCD + BCD + A

    Exercise 2.14 Simplify the following Boolean equations using Boolean theorems.
    Check for correctness using a truth table or K-map.
    (a) Y = ABC + ABC
    (b) Y = ABC + AB

    (c) Y = ABCD + ABCD + ðA + B + C + DÞ


    Exercise 2.15 Sketch a reasonably simple combinational circuit implementing
    each of the functions from Exercise 2.13.

    Exercise 2.16 Sketch a reasonably simple combinational circuit implementing


    each of the functions from Exercise 2.14.

    Exercise 2.17 Simplify each of the following Boolean equations. Sketch a


    reasonably simple combinational circuit implementing the simplified equation.
    (a) Y = BC + A B C + BC

    (b) Y = A + AB + A B + A + B
    (c) Y = ABC + ABD + ABE + ACD + ACE + ðA + D + EÞ + B CD
    + B CE + B D E + C D E

    Exercise 2.18 Simplify each of the following Boolean equations. Sketch a


    reasonably simple combinational circuit implementing the simplified equation.

    (a) Y = ABC + BC + BC
    (b) Y = ðA + B + CÞD + AD + B
    (c) Y = ABCD + ABCD + ðB + DÞE

    You might also like