EX NOR gate

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/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 the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock 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…