Digital Electronics Basic Gates MCQs

Digital Electronics
Surprise Test
Logic Gates Exam (Full Marks: 30)
Section A: Multiple Choice (10 Marks - 1 mark each)

1. Which logic gate outputs a HIGH only when one or both inputs are HIGH?
a) AND b) OR c) NAND d) NOR
2. The output of a NAND gate is LOW only when both inputs are:
a) HIGH b) LOW c) Same d) Different
3. An XOR gate produces a HIGH output when:
a) Both inputs are the same b) Both inputs are different
c) One input is HIGH, the other LOW d) None of the above
4. A logic circuit implements the following truth table:
A B Output
0 0 0
0 1 1
1 0 1
1 1 0
Which gate combination likely creates this output?
a) AND followed by OR b) OR followed by AND
c) XOR followed by inverter d) NOR followed by itself
5. Identify the logic gate with an output that is always the opposite of all its inputs combined. a) OR
b) AND c) NAND d) XOR
6. A logic circuit has two inputs (A and B) and one output (Y). The output Y is HIGH only when A is
LOW and B is HIGH. Which of the following gates can be used to implement this circuit?
a) OR b) AND with inverter on A c) XOR d) NOR with inverter on B
7. A logic gate has an output that is LOW only when exactly three out of four inputs are HIGH. Which
gate combination (using basic gates) can achieve this? (Tricky)
a) Three NAND gates followed by an OR gate b) Two NOR gates followed by an AND gate
c) Two XOR gates followed by an AND gate d) None of the above
8. Identify the universal logic gate(s) from the following:

a) OR only b) NAND only c) Both OR and NAND d) None of the above
9. Derive a minimized logic expression for the following truth table using only AND, OR, and NOT
operators: (Tough)
| A | B | Output |
|---|---|-------|
|0|0|1|
|0|1|0|
|1|0|0|
|1|1|1|
10. A logic circuit implements the following logic: "Output is HIGH only if the number of HIGH inputs
is odd." Which of the following best describes this circuit? (Tricky)
a) It uses only XOR gates.
b) It can be built using a combination of AND and OR gates.
c) It requires a special type of gate not covered in this exam.
d) The functionality is not possible with logic gates.
Section B: True or False (5 Marks - 1 mark each)

11. The output of an OR gate is LOW only when both inputs are LOW.
12. A NAND gate acts like an inverter (NOT gate) for a single input.
13. An XOR gate outputs a HIGH only when the inputs are different.
14. A logic circuit using only XOR gates can implement any other logic function (like AND, OR).
15. A logic circuit with multiple stages of the same logic gate (e.g., only NAND gates) can still achieve
complex functionalities.
16.The truth table for a NOR gate is the opposite of the OR gate. (It's actually the
opposite of AND)
17.An XNOR gate outputs a HIGH only when both inputs are the same.
18.A logic circuit cannot have more than two inputs.
19.Logic gates form the building blocks of digital circuits used in computers and other
electronic devices.
20.In a combinational logic circuit, the output depends only on the current inputs, not on
the past inputs.
Section C: Surprise (5 Marks - 1 mark each) | Demorgan's Law Questions
1. De Morgan's Law states that the negation of a disjunction (OR) is equivalent to:
a) The negation of both individual terms connected by AND.
b) The OR of both individual terms negated.
c) The negation of both individual terms connected by OR.
d) None of the above.
2. According to De Morgan's Law, the following is true:
a) NOT(A AND B) = A OR B b) NOT(A OR B) = A NAND B
c) NOT(A XOR B) = NOT(A) XOR NOT(B) d) NOT(A IMPLIES B) = B IMPLIES A
3. Consider the following logic expression: NOT(X OR Y). De Morgan's Law can be used to simplify
this to:
a) XY b) NOT(X) AND NOT(Y) c) X NOR Y d) X NAND Y
4. De Morgan's Law can be applied to simplify logic circuits. Which of the following best describes the
benefit of using De Morgan's Law?
a) It reduces the number of logic gates needed in a circuit.
b) It makes the circuit operate at a faster speed.
c) It improves the signal integrity within the circuit.
d) It allows for easier troubleshooting of circuit faults.
5. A logic circuit implements the following function: Output = NOT(A AND B). Using De Morgan's
Law, which of the following represents an equivalent circuit with potentially fewer gates?
a) Output = A OR B (Inverter on the output)
b) Output = NOT(A) OR NOT(B)
c) Output = A NAND B (Inverter on the output)
d) None of the above achieves the same functionality.

Section C: Surprise (5 Marks - 1 mark each) | Boolean's Law Questions
1. In Boolean algebra, which of the following represents the complement (opposite) of variable A?
a) A' b) ~A c) Both A' and ~A are valid representations. d) None of the above.
2. The distributive law in Boolean algebra states that:
a) A + (B * C) = (A + B) * (A + C)
b) A * (B + C) = (A * B) + (A * C)
c) A OR (B AND C) = (A OR B) AND (A OR C)
d) A AND (B OR C) = (A AND B) OR (A AND C)
3. The identity law for OR in Boolean algebra states that:
a) A OR 0 = 1 b) A OR 1 = A
c) A OR A = A d) All of the above
4. Simplify A + AB = A + B
5. Simplify (A + B) (A + C) = A + BC

Digital Electronics Basic Gates MCQs

Uploaded by

Copyright:

Available Formats

Digital Electronics Basic Gates MCQs

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Digital Electronics Basic Gates MCQs

Uploaded by

Copyright:

Available Formats

Digital Electronics

Section A: Multiple Choice (10 Marks - 1 mark each)

a) Both inputs are the same b) Both inputs are different

c) One input is HIGH, the other LOW d) None of the above

4. A logic circuit implements the following truth table:

Which gate combination likely creates this output?

a) AND followed by OR b) OR followed by AND

c) XOR followed by inverter d) NOR followed by itself

8. Identify the universal logic gate(s) from the following:

Section B: True or False (5 Marks - 1 mark each)

a) The negation of both individual terms connected by AND.

b) The OR of both individual terms negated.

c) The negation of both individual terms connected by OR.

d) None of the above.

2. According to De Morgan's Law, the following is true:

a) NOT(A AND B) = A OR B b) NOT(A OR B) = A NAND B

c) NOT(A XOR B) = NOT(A) XOR NOT(B) d) NOT(A IMPLIES B) = B IMPLIES A

a) It reduces the number of logic gates needed in a circuit.

b) It makes the circuit operate at a faster speed.

c) It improves the signal integrity within the circuit.

d) It allows for easier troubleshooting of circuit faults.

a) Output = A OR B (Inverter on the output)

b) Output = NOT(A) OR NOT(B)

c) Output = A NAND B (Inverter on the output)

d) None of the above achieves the same functionality.

d) A AND (B OR C) = (A AND B) OR (A AND C)

3. The identity law for OR in Boolean algebra states that:

c) A OR A = A d) All of the above

You might also like