The output of an XOR gate is 1 when
- A.Both inputs are 1
- B.Both inputs are 0
- C.The two inputs are different
- D.The two inputs are the same
Correct answer
Explanation
The correct answer is C, when the two inputs are different. An exclusive OR gate is a difference detector: it gives 1 for the combinations 0 and 1 or 1 and 0, and gives 0 when the inputs agree. It is sometimes read as either but not both. A is wrong because two inputs of 1 give an output of 0 in an XOR gate; that row is exactly what distinguishes it from an ordinary OR gate, which would give 1. B is wrong because two inputs of 0 also agree, so the output is again 0. D is wrong because an output of 1 for identical inputs describes the XNOR gate, the complement of XOR, which works as an equality detector and is used to compare two binary numbers bit by bit. In a half adder, the XOR gate supplies the sum bit while the AND gate supplies the carry.
Read the full article: Logic Gates and Boolean Algebra: Exam Notes
Practice Questions
View allWhich gate is represented by the following truth table? Input A, Input B, Output: 0, 0, 0; 0, 1, 1; 1, 0, 1; 1, 1, 1
- A.NOT
- B.OR
- C.XOR
- D.AND
Show answer
Read the table row by row. The output is 0 only when both inputs are 0, and it is 1 in the other three rows, including the row where both inputs are 1.
Read the full explanation →Which of the following pairs is known as universal gates?
- A.AND and OR
- B.NAND and NOR
- C.XOR and XNOR
- D.NOT and AND
Show answer
Each of these gates alone is enough to build every other gate and so every logic circuit: a NAND with its two inputs tied together acts as a NOT, two NANDs in sequence give an AND, and a suitable arrangement of three gives an OR, and the same can be…
Read the full explanation →According to De Morgan's theorem, the complement of the product of two variables A and B is equal to
- A.The product of the complements of A and B
- B.The sum of the complements of A and B
- C.The product of A and B itself
- D.Always equal to 1
Show answer
De Morgan's second theorem states that NOT of A AND B equals NOT A OR NOT B. The working rule is to break the bar and change the sign, so a dot under a complement becomes a plus once the complement is distributed over the variables.
Read the full explanation →A 'literal' in Boolean Algebra means
- A.A variable in its uncomplemented form only
- B.A variable or with its complement
- C.A variable in its complemented form only
- D.A variable in its complemented or uncomplemented form
Show answer
In Boolean algebra a literal is any single appearance of a variable in an expression, whether it appears plain or with a bar over it.
Read the full explanation →Boolean algebra, the basis of digital logic, was developed by
- A.Charles Babbage
- B.George Boole
- C.Blaise Pascal
- D.John von Neumann
Show answer
The system was a work of pure mathematics for decades until Claude Shannon showed that it described electrical switching circuits exactly, which opened the way to digital computing.
Read the full explanation →