DIGITAL FUNDAMENTALS 11TH EDITION
2026 COMPREHENSIVE SOLUTIONS
MANUAL CHAPTERS COVERED ANSWERS
GRADED A+
⩥ In true sum-of-products expressions, an inversion bar cannot cover
more than single variables in a term.
Answer: True
⩥ A K-map indicates the output value for each possible combination of
input values.
Answer: True
⩥ The input combination of A = 1, B = 0, C = 0, and D = 1 would be
represented on a Karnaugh map by the square labeled:
Answer: A|_B_|_C_|D
⩥ Each "1" in a K-map square represents:
Answer:
⩥ The ________ circuit produces a HIGH output whenever the two
inputs are unequal.
,Answer: Exclusive-OR
⩥ Generally speaking, when AND and OR gates are used to enable
signals, the output signal will follow the desired input signal exactly.
Answer: True
⩥ One method of determining an output from a logic circuit is to simply
track the inputs through the gates and determine the output.
Answer: True
⩥ The ________ circuit produces a HIGH output whenever the two
inputs are equal.
Answer: Exclusive-NOR
⩥ Using Boolean algebra to simplify the expression Z = AB + A(B + C)
+ B(B + C), the completed first step would result in the expression:
Answer: Z = AB + AB + AC + BB + BC
⩥ If output were required when both inputs are either false or true, a(n)
________ gate would apply.
Answer: Exclusive NOR
⩥ Which of the following expressions accurately describes the
Exclusive-OR function?
,Answer: X = _A_B + A_B_
⩥ The logic gate that produces a HIGH output whenever its two inputs
are equal is the:
Answer: Exclusive NOR.
⩥ The implementation of simplified sum-of-products expressions may
be easily implemented into actual logic circuits using all ________ with
little or no increase in circuit complexity.
Answer: NAND gates
⩥ A "floating" TTL logic input will usually act like a(n):
Answer: logic HIGH.
⩥ Which of the following is the simplest form of the expression Y =
ABC[AB + C(BC + AC)]?
Answer: V = ABC
⩥ Is it possible for a K-map to have two equally good solutions with
each solution being dependent on how the 1s are looped?
Answer: Yes
⩥ Using Boolean algebra, the original expression for Table 4-1
simplifies to:
, Answer: Z = L_N_+ M_N_
⩥ The goal in grouping K-map squares is to use the ________ number
of loops.
Answer: minimum
⩥ Exclusive gates can have any number of inputs.
Answer: False
⩥ The truth table in Table 4-1 indicates that:
Answer: The output (Z) is HIGH only when the binary input count is an
even number greater than zero.
⩥ Actual circuit implementation of the sum-of-products expression for
Table 4-1 would require (as a minimum):
Answer: three 3-input AND gates, one 3-input OR gate, and three
inverters.
⩥ TTL family of chips are indicated by a seventy-four at the beginning
of the part number.
Answer: True
⩥ The hexadecimal equivalent for 1100 1010 0111 10012 is:
2026 COMPREHENSIVE SOLUTIONS
MANUAL CHAPTERS COVERED ANSWERS
GRADED A+
⩥ In true sum-of-products expressions, an inversion bar cannot cover
more than single variables in a term.
Answer: True
⩥ A K-map indicates the output value for each possible combination of
input values.
Answer: True
⩥ The input combination of A = 1, B = 0, C = 0, and D = 1 would be
represented on a Karnaugh map by the square labeled:
Answer: A|_B_|_C_|D
⩥ Each "1" in a K-map square represents:
Answer:
⩥ The ________ circuit produces a HIGH output whenever the two
inputs are unequal.
,Answer: Exclusive-OR
⩥ Generally speaking, when AND and OR gates are used to enable
signals, the output signal will follow the desired input signal exactly.
Answer: True
⩥ One method of determining an output from a logic circuit is to simply
track the inputs through the gates and determine the output.
Answer: True
⩥ The ________ circuit produces a HIGH output whenever the two
inputs are equal.
Answer: Exclusive-NOR
⩥ Using Boolean algebra to simplify the expression Z = AB + A(B + C)
+ B(B + C), the completed first step would result in the expression:
Answer: Z = AB + AB + AC + BB + BC
⩥ If output were required when both inputs are either false or true, a(n)
________ gate would apply.
Answer: Exclusive NOR
⩥ Which of the following expressions accurately describes the
Exclusive-OR function?
,Answer: X = _A_B + A_B_
⩥ The logic gate that produces a HIGH output whenever its two inputs
are equal is the:
Answer: Exclusive NOR.
⩥ The implementation of simplified sum-of-products expressions may
be easily implemented into actual logic circuits using all ________ with
little or no increase in circuit complexity.
Answer: NAND gates
⩥ A "floating" TTL logic input will usually act like a(n):
Answer: logic HIGH.
⩥ Which of the following is the simplest form of the expression Y =
ABC[AB + C(BC + AC)]?
Answer: V = ABC
⩥ Is it possible for a K-map to have two equally good solutions with
each solution being dependent on how the 1s are looped?
Answer: Yes
⩥ Using Boolean algebra, the original expression for Table 4-1
simplifies to:
, Answer: Z = L_N_+ M_N_
⩥ The goal in grouping K-map squares is to use the ________ number
of loops.
Answer: minimum
⩥ Exclusive gates can have any number of inputs.
Answer: False
⩥ The truth table in Table 4-1 indicates that:
Answer: The output (Z) is HIGH only when the binary input count is an
even number greater than zero.
⩥ Actual circuit implementation of the sum-of-products expression for
Table 4-1 would require (as a minimum):
Answer: three 3-input AND gates, one 3-input OR gate, and three
inverters.
⩥ TTL family of chips are indicated by a seventy-four at the beginning
of the part number.
Answer: True
⩥ The hexadecimal equivalent for 1100 1010 0111 10012 is:
