Not Gate

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-POLYTECHNIC-LECTURER-COMPUTER-SCIENCE/digital-logic/logic-gates-hardware/evolution-not-or-and-gates/asset-not-gate after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  2. Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Pipelining, Multiprocessors
  4. Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  5. Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  6. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  7. Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
  8. Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  9. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
  10. Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, ORDBMS, NoSQL
  11. Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This short lecture introduces the Not Gate, also called an inverter. The slide states that it represents the NOT logical operator and is a unary operator that simply complements the input. The instructor presents the standard logic symbol with input X, output Y = X', and an inversion bubble at the output. A truth table is completed to show that input 0 produces output 1, while input 1 produces output 0. A circuit diagram on the right shows a voltage source connected through switch A to an inductor L, used as a physical illustration of switching behavior. Because only sampled screenshots are available and no audio transcript is provided, the exact spoken explanation beyond visible slide text cannot be fully verified.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The slide titled "Not Gate(Inverter)" defines the gate as a unary operator that complements its input. The visible text reads, "It represents not logical operator is also known as inverter, it is a unary operator, which simply complement the input." A truth table with columns "Input" and "Output" shows the header "X / Y = X'" and rows for inputs 0 and 1. The instructor points to the Not Gate symbol, highlighting input X, output Y, and the small inversion bubble. On the right, a circuit diagram labeled "Voltage source" shows switch A in series with an inductor L.

  2. 2:00 – 3:14 02:00-03:14

    The truth table is filled in to demonstrate inversion: input 0 gives output 1, and input 1 gives output 0. The visible header changes to "Input X" and "Output Y = X'" in later frames. The instructor gestures between the gate symbol, the truth table, and the circuit diagram on the right. The circuit includes a voltage source, an ammeter, and an inductor load, illustrating the switching action associated with the gate. Handwritten values appear in the output column, confirming the complement relationship.

The central idea is that a Not Gate inverts a single binary input. The key evidence includes the slide definition, the logic symbol with an inversion bubble, and the completed truth table: 0 becomes 1 and 1 becomes 0. The circuit diagram with a voltage source, switch A, inductor L, and ammeter provides a physical analogy for switching behavior. For revision, students should remember the term inverter, the unary nature of the gate, the symbol's bubble indicating inversion, and the truth table values. The lesson is concise and focused on one gate type.

Loading lesson…