1.What is the function of the AND logic gate, and what does its truth table look like for two inputs?
2.How does the OR logic gate work, and what is its truth table for two inputs?
3.What does the NOT logic gate do, and what is its truth table for one input?
4.What is the NAND gate, and how does its truth table differ from the AND gate?
5.Explain the NOR gate and provide its truth table for two inputs.
1.
Answer: The AND gate outputs 1 only if both inputs are 1. Truth table:
- A=0, B=0 → Output=0
- A=0, B=1 → Output=0
- A=1, B=0 → Output=0
- A=1, B=1 → Output=1
Description: The AND gate models situations where two conditions must be true for an action to occur, like a system requiring two switches to be ON. The truth table shows all possible input combinations and their outputs, helping students understand its behavior.
2.
Answer: The OR gate outputs 1 if at least one input is 1. Truth table:
- A=0, B=0 → Output=0
- A=0, B=1 → Output=1
- A=1, B=0 → Output=1
- A=1, B=1 → Output=1
Description: The OR gate is useful when any one condition being true is enough, like a light turning on with either of two switches. The truth table helps visualize this logic clearly.
3.
Answer: The NOT gate inverts the input (0 becomes 1, 1 becomes 0). Truth table:
- A=0 → Output=1
- A=1 → Output=0
Description: The NOT gate is a simple inverter, flipping the input state. Its truth table is straightforward, showing how it reverses the input, which is key in logic design.
4.
Answer: The NAND gate is an AND gate followed by a NOT gate. Truth table:
- A=0, B=0 → Output=1
- A=0, B=1 → Output=1
- A=1, B=0 → Output=1
- A=1, B=1 → Output=0
Description: The NAND gate outputs the opposite of the AND gate. It’s widely used because it can create other gates, making it versatile in circuits. Comparing it to AND helps students see the inversion effect.
5.
Answer: The NOR gate is an OR gate followed by a NOT gate. Truth table:
- A=0, B=0 → Output=1
- A=0, B=1 → Output=0
- A=1, B=0 → Output=0
- A=1, B=1 → Output=0
Description: The NOR gate outputs 1 only when both inputs are 0, making it the opposite of OR. Its truth table reinforces the concept of inversion applied to OR logic.