Lecture 3 - Introduction to Computing

Logic diagrams and truth tables are equally powerful in expressing the processing of gates and circuits.

• true
• false

Boolean expressions are more powerful than logic diagrams in expressing the processing of gates and circuits.

• true
• false

A not gate accepts two inputs.

• true
• false

The output value of an AND gate is 1 when both inputs are 1.

• true
• false

The AND and OR gates produce opposite results for the same input.

• true
• false

The output value of an OR gate is 1 when both inputs are 1.

• true
• false

The output value of an OR gate is 0 when one input is 0 and one input is 1.

• true
• false

The output value of an XOR gate is 0 unless both inputs are 1.

• true
• false

The NOR gate produces the opposite results of the XOR gate.

• true
• false

A gate can be designed to accept more than two inputs.

• true
• false