Question 1: Write the truth table for the AND gate with two inputs, A and B, where A and B can be either 0 or 1.

Answer: | A | B | Output | |---|---|---------| | 0 | 0 | 0 | | 0 | 1 | 0 | | 1 | 0 | 0 | | 1 | 1 | 1 |

Question 2: Write the truth table for the OR gate with two inputs, A and B, where A and B can be either 0 or 1.

Answer: | A | B | Output | |---|---|---------| | 0 | 0 | 0 | | 0 | 1 | 1 | | 1 | 0 | 1 | | 1 | 1 | 1 |

Question 3: Write the truth table for the NOT gate when the input A can be either 0 or 1.

Answer: | A | Output | |---|---------| | 0 | 1 | | 1 | 0 |

Question 4: Complete the truth table for a NAND gate with inputs A and B.

Answer: | A | B | Output | |---|---|---------| | 0 | 0 | 1 | | 0 | 1 | 1 | | 1 | 0 | 1 | | 1 | 1 | 0 |

Question 5: Complete the truth table for an XOR gate with two inputs, A and B.

Answer: | A | B | Output | |---|---|---------| | 0 | 0 | 0 | | 0 | 1 | 1 | | 1 | 0 | 1 | | 1 | 1 | 0 |

Question 6: Draw a logic circuit that uses AND, OR, and NOT gates to produce an output that is true only when A is true and B is false.

Answer: A correct sketch would include an AND gate with inputs A and the output of a NOT gate, which takes B as input. The output of the AND gate is the final output.

Question 7: Sketch a logic circuit that represents the Boolean expression: (A AND B) OR (NOT A).

Answer: A correct sketch would include an AND gate with inputs A and B, a NOT gate with input A, and an OR gate combining the outputs of these two gates.

Question 8: Explain in your own words what a Boolean variable is.

Answer: A Boolean variable is a variable that can only hold one of two values: 0 (false) or 1 (true).

Question 9: If A is 1 and B is 0, what is the output of an OR gate with inputs A and B?

Answer: 1

Question 10: If A is 0 and B is 0, what is the output of a NAND gate with inputs A and B?

Answer: 1

Question 11: Describe what the truth table for a NOT gate looks like when the input is 1.

Answer: When the input is 1, the output of a NOT gate is 0.