EX NOR gate

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/SSC-JE-IMD-SCIENTIFIC-ASSISTANT-COMPUTER-SCIENCE/part-d-cs-it/logic-gates-hardware/ex-or-ex-nor-gate-relation/asset-ex-nor-gate after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. General Intelligence & Reasoning: Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Logical Sequence Of Words, Syllogisms, Venn Diagram, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Data Sufficiency, Puzzle Solving (Puzzles), Data Arrangement, Cubes & Dices, Calendar, Clock, Arithmetic, Number System, HCF LCM, Verbal Analogy (Word Based Analogy), Visual Recognition and Figure Completion, Paper Folding and Cutting, Transformation of Shapes, Clocks and Calendars, Direction Sense, Cubes and Dice, Patterns in Two-Dimensional Figures, Seating Arrangements, Analogy and Classification, Logical Deduction and Induction, Alphabet and Word Tests, Mathematical Operations, Series Completion, Simplification and Approximation, Coding and Decoding, Numerical Reasoning, Assembling and Grouping of Shapes, Three-Dimensional Patterns and Visualization, Vocabulary, Number System, Averages, Mixtures and Alligation, Simple and Compound Interest, Percentages, Algebra, Speed, Time and Distance, Seating and Arrangement Puzzles, Traverse Surveying, Order, Ranking and Sequence, Constraint Puzzles, Syllogisms and Venn Diagrams, Reading Comprehension, Critical Reasoning, Permutations and Combinations, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Ratio and Proportion, Time and Work, Mensuration, Data Interpretation, Powers, Surds and Logarithms, Sequences and Series, Articles and Determiners, Sentence Completion, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, Sequence and Series (Series), Speed Time and Distance, Algebra, Profit and Loss, Powers and Exponents (Surds and Indices), Permutation and Combination
  2. General Awareness: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, Environment, Static General Knowledge, GK- Current Affairs, Artificial Intelligence, MS Office Applications, Terms & Abbreviations, Keyboard Shortcuts, Evolution of Indian Banking (Banking & Financial Awareness), Emerging Tech Trends
  3. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics
  4. Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Number Systems and Codes, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Latches and Flip-Flops, Finite State Machines, Sequential Circuits and State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Latches and Flip-Flops, Number Systems and Codes, Registers and Counters
  5. Computer Organisation & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Register Transfer and Microoperations, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Registers and Counters
  6. Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, HTML Basics, OOPS with C++, Java, Object Oriented Technology
  7. Databases: 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, Database Recovery, Database Security & Authorization
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
  10. 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
  11. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Security, Windows OS, Distributed Systems, Unix OS, Linux OS
  12. Computer Networks: Introduction to CN, 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, Data Communication, Website, Browser & Services, Web Design & Development, Network Security, Cyber Threats and Malware Attacks, Cyber Safety and Security
  13. Full Length Mock Tests:
  14. Sectional Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed lecture on the EX-NOR logic gate, presented by Sanchit Jain Sir. The lesson begins by defining the EX-NOR gate for two inputs, explaining that the output is high only when both inputs are identical. It covers the boolean expression and truth table for the 2-input case. The lecture then expands to 3-input EX-NOR gates, introducing a specific rule regarding the even number of low inputs. Finally, the video explores algebraic properties of the EX-NOR gate, including operations with constants (0 and 1), identical variables, and complements, as well as fundamental Boolean laws like associativity and commutativity.

Chapters

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

    The video opens with a slide titled 'EX-NOR' defining the gate for two inputs. The text states, 'For two input, output will be high if and only if both the input values are same.' The boolean expression is given as $a \odot b = a'.b' + a.b$. The instructor draws the standard EX-NOR gate symbol, which resembles an XOR gate with an inverted output bubble. A truth table is displayed with columns for Input A, Input B, and Output Y. The instructor explains that when inputs are 0 and 0, the output is 1. When inputs are 0 and 1, the output is 0. Similarly, for 1 and 0, the output is 0. Finally, for 1 and 1, the output is 1. He writes the boolean equation on the board to reinforce the logic.

  2. 2:00 – 5:00 02:00-05:00

    The lecture progresses to a 3-input EX-NOR gate. The slide text reads, 'The EX-NOR gate is a digital logic gate that gives output High when the number inputs low are even.' A truth table with columns A, B, C, and output $a \odot b \odot c$ is shown. The instructor fills the table based on the rule of even low inputs. For inputs 0,0,0 (three lows), the output is 0. For 0,0,1 (two lows), the output is 1. He continues filling the table, noting that 0,1,0 yields 1, while 0,1,1 yields 0. He writes side notes indicating '1 -> odd = 1' and '0 -> even = 1' to clarify the counting logic for the students. The table is completed showing the pattern of outputs for all 8 combinations of three inputs.

  3. 5:00 – 6:42 05:00-06:42

    The final section covers specific properties and laws of the EX-NOR gate. The slide lists four scenarios: EX-NOR with ZERO, ONE, SAME, and COMPLEMENT. The instructor solves $(a \odot 0) = a'$, labeling it 'Comp'. He solves $(a \odot 1) = a$, labeling it 'Same'. For $(a \odot a)$, he derives the result as 1. For $(a \odot a')$, the result is 0. He then discusses the Idempotent law, writing $(a \odot a) eq a$. He also addresses the Associative law, writing $(a \odot b) \odot c = a \odot (b \odot c)$, and the Commutative law, writing $(a \odot b) = (b \odot a)$. This section solidifies the algebraic manipulation rules for EX-NOR operations.

The video provides a comprehensive overview of the EX-NOR logic gate, starting from its fundamental definition and 2-input truth table. It expands the concept to 3-input scenarios, introducing the rule regarding even numbers of low inputs. Finally, it details algebraic properties involving constants and variables, along with fundamental Boolean laws like associativity and commutativity. This progression helps students understand both the logical behavior and mathematical manipulation of EX-NOR gates.

Loading lesson…