Describing Logic Circuits Questions

• The effect of an inverted output being connected to the inverting input of another gate is to effectively eliminate one of the inversions, resulting in a single inversion.
• The timing diagram for a two-input NAND gate is shown below. The gate is working correctly.
• A NAND gate consists of an AND gate and an OR gate connected in series with each other.
• The NAND gate is an example of combinational logic.
• The symbol shown below is an AND gate.
• In Boolean algebra, 1 · 0 = 0.
• VHDL is not a new language.
• A two-input NAND gate has inputs of 1 and 0; the output is 0.
• The output of a NAND gate is the inverse of the output for an AND gate for all possible input combinations.
• The commutative law of Boolean addition states that A + B = A · B.
• Boolean algebra was first applied to the analysis of digital circuits by Claude Shannon at Stanford University.
• Output logic levels for certain input conditions of a logic circuit may often be determined without using the Boolean expression.
• The expressions, , are equivalent.
• The application of DeMorgan's theorems to a Boolean expression with double and single inversions produces a resultant expression that contains only single inverter signs over single variables.
• The OR gate performs like two switches wired in a series.
• The truth table shown below describes the operation of a NOR gate.
• The given figure shows the correct logic implementation of the distributive law.
• Boolean multiplication is symbolized by A + B.
• The comments in ADHL are enclosed between # characters.
• The figure given below is an example of the implementation of AND-OR-INVERT logic.