Which of the following logic gates has output low when one of the inputs is high?
NOR
Logic gates are the fundamental building blocks of digital electronics. They perform basic logical operations based on binary inputs (represented as 0 for low voltage and 1 for high voltage). This question asks us to identify the logic gate that exhibits a specific behavior: its output is low (0) when any one of its inputs is high (1).
To find the correct logic gate, let's review the standard operations of the gates provided in the options:
A truth table provides a clear way to see the output for every possible combination of inputs. Here's a comparison for two-input versions of the gates:
| Input A | Input B | OR Output | NOR Output | AND Output | NAND Output |
| 0 | 0 | 0 | 1 | 0 | 1 |
| 0 | 1 | 1 | 0 | 0 | 1 |
| 1 | 0 | 1 | 0 | 0 | 1 |
| 1 | 1 | 1 | 0 | 1 | 0 |
The question specifically asks for the gate where the output is low (0) when one of the inputs is high (1). Let's examine the truth table rows where at least one input is 1:
In all scenarios where at least one input is high (1), the NOR gate consistently produces a low output (0). This matches the condition stated in the question precisely.
Therefore, the NOR gate is the logic gate that has its output low when one of the inputs is high.
Which of the following gates gives output 1 when any one of the input is 1?
The NAND gate output will be low if the two inputs are-
Minimum number of NAND gates required to implement the following binary equation $Y = (A+B)(\overline{C \cdot D})$
Which of the following statements are true?
(i) Every logic network is equivalent to one using just NAND gates or just NOR gates.
(ii) Boolean expressions and logic networks correspond to labelled acyclic digraphs.
(iii) No two Boolean algebras with n atoms are isomorphic.
(iv) Non-zero elements of finite Boolean algebras are not uniquely expressible as joins of atoms.In a PLA, what components are used to implement the combinational logic functions?