EX NOR gate

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/digital-electronics/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. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: 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, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: 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, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
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…