Test on Logic gates and Boolean algebra
Logic Gates and Boolean Algebra: A Student's Guide
Test: Digital Logic
20 questions
Question 1: NAND gates are considered universal because they can be used to construct basic gates like AND, OR, and NOT, but they cannot be used to create more complex gates such as XOR or XNOR.
A. Yes
B. No
Explanation: NAND gates are indeed universal, but the study materials state that 'any other logic gate (AND, OR, NOT, XOR, XNOR) can be constructed solely using either NAND gates or NOR gates.' This means NAND gates *can* be used to create complex gates like XOR and XNOR, contradicting the statement that they cannot.
Question 2: For a half-adder, the Sum output is determined by an XOR operation of its inputs, and the Carry output is determined by an AND operation of its inputs.
A. Yes
B. No
Explanation: The study materials state that for a half-adder, the Boolean expression for the Sum is S = A ⊕ B (A XOR B) and for the Carry is C = A · B (A AND B). It further clarifies that a half-adder uses one XOR gate for the Sum output and one AND gate for the Carry output.
Question 3: The Null Law in Boolean algebra states that the sum of a variable A and 1 (A + 1) results in 0.
A. Yes
B. No
Explanation: The study materials state that the Null Law is 'A + 1 = 1'. Therefore, the statement that A + 1 results in 0 is incorrect.
Question 4: For a two-input XOR gate, the output is 1 when its inputs are different.
A. Yes
B. No
Explanation: The study materials explicitly state: 'For a two-input XOR gate, the output is 1 if the inputs are different, and 0 if they are the same.' This confirms that different inputs result in a 1 output.
Question 5: According to the basic Boolean laws, the expression A + 1 simplifies to A.
A. Yes
B. No
Explanation: The Null Law states that A + 1 = 1, not A. Therefore, the expression A + 1 simplifies to 1, not A.