Question 1

Using Boolean algebra to simplify the expression Z = AB + A(B + C) + B(B + C), the completed first step would result in the expression:
A) Z = AA + AB + AB + AC + BB + BC
B) Z = AB + AB + AC + BB + BC
C) Z = AB + ABAC + BB + BC
D) Z = AB + AB + C + BB + C

Accepted Answer

The first step in simplifying the given expression using Boolean algebra involves expanding the expression based on the distributive law, which states A(B + C) = AB + AC. Therefore, the expression Z = AB + A(B + C) + B(B + C) simplifies to Z = AB + AB + AC + BB + BC, as each term is expanded accordingly.

Question 2

Using Boolean algebra, the complete simplification of Z = AB + A(B + C) + B(B + C) gives us:
A) Z = AB = AC = BC
B) Z = AB + AC + B + BC
C) Z = B - AC
D) Z = AB + AC + B

Accepted Answer

C

Question 3

Using Boolean algebra, the expression Y =  simplifies to:
A) Y = BC + 
B) Y = 
C) Y = C
D) Y =

Accepted Answer

C

Question 4

Using Boolean algebra to simplify the expression Z = , the completed first step would result in the expression:
A) Z = 
B) Z = 
C) Z=
D) Z =

Accepted Answer

The answer of Using Boolean algebra to simplify the expression...

Question 5

Using Boolean algebra, the complete simplification of Z = (D + E + F) (D + E + F)  gives us:
A) Z = 
B) Z =
C) Z = 
D) Z = (D + E)

Accepted Answer

The answer of Using Boolean algebra, the complete simplification of...

Question 6

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.
A) OR gates
B) multiple- input inverters
C) NAND gates
D) AND gates

Accepted Answer

NAND gates are versatile in digital logic circuits because they can be used to implement any Boolean function without increasing circuit complexity significantly. This includes the implementation of simplified sum-of-products expressions, as NAND gates can be configured to perform the functions of both AND and OR gates, as well as inverters, through appropriate combinations.

Question 7

Each "1" in a K- map square represents:
A) an input combination that results in a LOW output.
B) an input combination that results in a HIGH output.
C) an input combination that results in a DON'T CARE grouping.
D) None of the above.

Accepted Answer

A "1" in a K-map square represents an input combination that results in a HIGH output, indicating a true condition for the function being mapped.

Question 8

Which of the following Boolean expressions is in sum- of- products form
A) X = 
B) X = 
C) X = 
D) X =

Accepted Answer

The answer of Which of the following Boolean expressions is...

Question 9

The input combination of A = 1, B = 0, C = 0, and D = 1 would be represented on a Karnaugh map by the square labeled:
A) 
B) ABCD
C) 
D)

Accepted Answer

The answer of The input combination of A = 1,...

Question 10

A logic circuit allows a signal (A) to pass to the output without inversion when either (but not both) of the control signals (B₁and B₂) are HIGH. Which of the following is the output expression for this circuit? A) X= B) X= C) X = D) X =

Accepted Answer

The answer of A logic circuit allows a signal (A)...

Question 11

The logic gates required to implement the logic circuit in the preceding question would be: A) an Exclusive NOR gate with inputs B₁and B₂whose output is fed, along with input A, to an AND gate. B) an Exclusive OR gate with inputs B₁and B₂whose output, is fed along with input A, to an AND gate. C) an Exclusive OR gate with inputs B₁and B₂whose output is fed, along with input A, to an OR gate. D) an Exclusive NOR gate with inputs B₁and B₂whose output is fed, along with input A, to an OR gate.

Accepted Answer

The correct logic gate to implement the described logic circuit is an Exclusive OR (XOR) gate with the specified inputs, whose output is then fed along with input A to an AND gate. This configuration allows for the output to be true only when the inputs differ and when input A is true, aligning with the typical behavior of an XOR gate followed by an AND gate for conditional output.

Question 12

The output of an OR gate is connected directly to the input of an AND gate. The other AND gate input is a constant "Enable" HIGH. A technician checks the inputs to the OR gate and notes a HIGH and LOW. The output of the OR gate is noted as being a HIGH. The "Enable" HIGH input to the AND gate is verified as normal. The technician checks the OR gate input to the AND gate and observes a LOW or no voltage condition. Of the probable causes listed, select the one that most likely is the problem. Assume CMOS gates.
A) A short between the OR gate output and the AND gate input
B) An internal short in the AND gate
C) An open connection between the OR gate output and the AND gate input
D) A short between the input terminals of the AND gate

Accepted Answer

Given the scenario, the most likely issue is an open connection between the OR gate output and the AND gate input. This would explain why the OR gate's output is HIGH (due to one HIGH input), but the AND gate does not receive this HIGH signal, showing a LOW or no voltage condition instead.

Question 13

Which of the following statements accurately represents the two best methods of logic circuit simplification?
A) Boolean algebra and Karnaugh mapping
B) Boolean algebra and actual circuit trial and error evaluation
C) Karnaugh mapping and circuit waveform analysis
D) Actual circuit trial and error evaluation and waveform analysis

Accepted Answer

Boolean algebra and Karnaugh mapping are widely recognized as the two primary methods for simplifying logic circuits. Boolean algebra uses algebraic techniques to simplify logic equations, while Karnaugh maps provide a visual method for simplifying Boolean expressions without the need for extensive calculations.

Question 14

Is it possible for a K- map to have two equally good solutions with each solution being dependent on how the 1s are looped?

Accepted Answer

In Karnaugh maps (K-maps), different ways of grouping 1s can lead to equally valid but different solutions for simplifying Boolean expressions, as long as all prime implicants are covered.

Question 15

The application of DeMorgan's theorems will reduce the expression X =   to which sum-of-products expression?
A) X = 
B) X = 
C) X = 
D) X =

Accepted Answer

The answer of The application of DeMorgan's theorems will reduce...

Question 16

You are troubleshooting a TTL circuit board containing dozens of IC chips. You have taken several readings at numerous IC chips but the readings are inconclusive because of their erratic nature. Assuming the circuit worked properly at one time, what is the most likely cause of the problem? A) A solder bridge between the inputs on the first IC chip on the board B) An open connection between the inputs on the first IC chip on the board C) A defective output IC chip that has an internal open to V_cc D) A defective IC chip that is drawing excessive current from the power supply

Accepted Answer

A defective IC chip drawing excessive current can cause erratic readings across a TTL circuit board by affecting the power supply stability, impacting the performance of other components.

Question 17

A 3-input (A, B, and C) logic circuit has a HIGH output only when A=1, B=1, and C=1 or when A=0, B=1, and C=1. Which of the following sum-of-products expressions describes this function?
A) X = 
B) X =
C) X = 
D) X =

Accepted Answer

The answer of A 3-input (A, B, and C) logic...

Question 18

A "floating" TTL logic input will usually act like a(n):
A) logic HIGH.
B) logic LOW.
C) active low input.
D) ground.

Accepted Answer

A "floating" TTL logic input typically acts like a logic HIGH because of the internal pull-up resistors that bias the input to a high state when it is not actively driven low.

Question 19

ULSI circuits contain:
A) 100,000 to 999,999 gates.
B) 1,000,000 or more gates.
C) 100 to 9,999 gates.
D) 10,000 to 99,999 gates.

Accepted Answer

The answer of ULSI circuits contain:
A) 100,000 to 999,999 gates.
B)...

Question 20

The logic gate that produces a HIGH output whenever its two inputs are unequal is the:
A) Exclusive OR.
B) NOR.
C) NAND.
D) Exclusive NOR.

Accepted Answer

The Exclusive OR (XOR) logic gate produces a HIGH output (1) only when its two inputs are different from each other. If the inputs are the same, the output is LOW (0).

Quiz 4: Combinational Logic Circuits

Using Boolean algebra to simplify the expression Z = AB + A(B + C) + B(B + C) , the completed first step would result in the expression:

Using Boolean algebra, the complete simplification of Z = AB + A(B + C) + B(B + C) gives us:

Using Boolean algebra, the expression Y = simplifies to:

Using Boolean algebra to simplify the expression Z = , the completed first step would result in the expression:

Using Boolean algebra, the complete simplification of Z = (D + E + F) (D + E + F) gives us:

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.

Each "1" in a K- map square represents:

Which of the following Boolean expressions is in sum- of- products form

The input combination of A = 1, B = 0, C = 0, and D = 1 would be represented on a Karnaugh map by the square labeled:

A logic circuit allows a signal (A) to pass to the output without inversion when either (but not both) of the control signals (B₁and B₂) are HIGH. Which of the following is the output expression for this circuit?

The logic gates required to implement the logic circuit in the preceding question would be:

Which of the following statements accurately represents the two best methods of logic circuit simplification?

Is it possible for a K- map to have two equally good solutions with each solution being dependent on how the 1s are looped?

The application of DeMorgan's theorems will reduce the expression X = to which sum-of-products expression?

You are troubleshooting a TTL circuit board containing dozens of IC chips. You have taken several readings at numerous IC chips but the readings are inconclusive because of their erratic nature. Assuming the circuit worked properly at one time, what is the most likely cause of the problem?

A 3-input (A, B, and C) logic circuit has a HIGH output only when A=1, B=1, and C=1 or when A=0, B=1, and C=1. Which of the following sum-of-products expressions describes this function?

A "floating" TTL logic input will usually act like a(n) :

ULSI circuits contain:

The logic gate that produces a HIGH output whenever its two inputs are unequal is the:

Quiz 4: Combinational Logic Circuits

Using Boolean algebra to simplify the expression Z = AB + A(B + C) + B(B + C) , the completed first step would result in the expression:

Using Boolean algebra, the complete simplification of Z = AB + A(B + C) + B(B + C) gives us:

Using Boolean algebra, the expression Y = simplifies to:

Using Boolean algebra to simplify the expression Z = , the completed first step would result in the expression:

Using Boolean algebra, the complete simplification of Z = (D + E + F) (D + E + F) gives us:

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.

Each "1" in a K- map square represents:

Which of the following Boolean expressions is in sum- of- products form

The input combination of A = 1, B = 0, C = 0, and D = 1 would be represented on a Karnaugh map by the square labeled:

A logic circuit allows a signal (A) to pass to the output without inversion when either (but not both) of the control signals (B1 and B2) are HIGH. Which of the following is the output expression for this circuit?

The logic gates required to implement the logic circuit in the preceding question would be:

Which of the following statements accurately represents the two best methods of logic circuit simplification?

Is it possible for a K- map to have two equally good solutions with each solution being dependent on how the 1s are looped?

The application of DeMorgan's theorems will reduce the expression X = to which sum-of-products expression?

You are troubleshooting a TTL circuit board containing dozens of IC chips. You have taken several readings at numerous IC chips but the readings are inconclusive because of their erratic nature. Assuming the circuit worked properly at one time, what is the most likely cause of the problem?

A 3-input (A, B, and C) logic circuit has a HIGH output only when A=1, B=1, and C=1 or when A=0, B=1, and C=1. Which of the following sum-of-products expressions describes this function?

A "floating" TTL logic input will usually act like a(n) :

ULSI circuits contain:

The logic gate that produces a HIGH output whenever its two inputs are unequal is the:

A logic circuit allows a signal (A) to pass to the output without inversion when either (but not both) of the control signals (B₁and B₂) are HIGH. Which of the following is the output expression for this circuit?