When an input signal \[1\] is applied to a NOT gate, its output is:
A) \[1\]
B) \[0\]
C) Either \[0\] or \[1\]
D) Both \[0\] and \[1\]
Answer
249k+ views
Hint: NOT gate is one of the basic logical gates. It can be remembered from the name itself that NOT implies getting the opposite output. Remember all the basic gates to avoid confusion.
Complete step by step solution:
The various basic logic gates used digital systems are as follows:
1. OR Gate
2. AND Gate
3. NOT Gate
4. XOR Gate
Below is the NOT gate.

OR GATE: In OR gate the output of an OR gate gives the state \[1\] , if one or more inputs attain the state \[1\] i.e. when any one input is \[1\] then the output will be one.
The Boolean expression of the OR gate is given as \[Y=A+B\], which is read as \[Y\] equals \[A\] ‘\[OR\] ’ \[B\].
AND GATE: In AND gate the output of an AND gate is \[1\] if and only if all the inputs are in state \[1\]. The Boolean expression of AND gate is \[Y=A.B\] which is read as Y equals A ‘AND’ B.
NOT GATE: In NOT gate the output of a NOT gate attains the state \[1\] if and only if the input does not attain the state \[1\] . The Boolean expression is \[Y=\overline{A}\] , read as Y equals NOT A.
Hence for input signal \[1\] the output will be \[0\].
Note: All basic gates must be remembered. NAND and XNOR gates are the logical gates which can be obtained using the basic OR, NOT and AND gate. Also the truth table can be easily constructed for each logical gate based on the above definitions. Truth tables make it easier to understand logical gates.
Complete step by step solution:
The various basic logic gates used digital systems are as follows:
1. OR Gate
2. AND Gate
3. NOT Gate
4. XOR Gate
Below is the NOT gate.

OR GATE: In OR gate the output of an OR gate gives the state \[1\] , if one or more inputs attain the state \[1\] i.e. when any one input is \[1\] then the output will be one.
The Boolean expression of the OR gate is given as \[Y=A+B\], which is read as \[Y\] equals \[A\] ‘\[OR\] ’ \[B\].
AND GATE: In AND gate the output of an AND gate is \[1\] if and only if all the inputs are in state \[1\]. The Boolean expression of AND gate is \[Y=A.B\] which is read as Y equals A ‘AND’ B.
NOT GATE: In NOT gate the output of a NOT gate attains the state \[1\] if and only if the input does not attain the state \[1\] . The Boolean expression is \[Y=\overline{A}\] , read as Y equals NOT A.
Hence for input signal \[1\] the output will be \[0\].
Note: All basic gates must be remembered. NAND and XNOR gates are the logical gates which can be obtained using the basic OR, NOT and AND gate. Also the truth table can be easily constructed for each logical gate based on the above definitions. Truth tables make it easier to understand logical gates.
Recently Updated Pages
JEE Isolation, Preparation and Properties of Non-metals Important Concepts and Tips for Exam Preparation

Isoelectronic Definition in Chemistry: Meaning, Examples & Trends

Ionisation Energy and Ionisation Potential Explained

Iodoform Reactions - Important Concepts and Tips for JEE

Introduction to Dimensions: Understanding the Basics

Instantaneous Velocity Explained: Formula, Examples & Graphs

Trending doubts
JEE Main 2026: Exam Dates, Session 2 Updates, City Slip, Admit Card & Latest News

Hybridisation in Chemistry – Concept, Types & Applications

Understanding the Electric Field of a Uniformly Charged Ring

JEE Main 2026 Application Login: Direct Link, Registration, Form Fill, and Steps

Derivation of Equation of Trajectory Explained for Students

Understanding the Angle of Deviation in a Prism

Other Pages
CBSE Class 12 Physics Question Paper 2026: Download SET-wise PDF with Answer Key & Analysis

JEE Advanced Marks vs Ranks 2025: Understanding Category-wise Qualifying Marks and Previous Year Cut-offs

JEE Advanced 2026 - Exam Date (Released), Syllabus, Registration, Eligibility, Preparation, and More

JEE Advanced Weightage 2025 Chapter-Wise for Physics, Maths and Chemistry

Understanding Centrifugal Force in Physics

Understanding Collisions: Types and Examples for Students

