EX OR gate

Duration: 11 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-or-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 प्रश्न (निश्चित)): رسم الخط، حروفِ تہجی اور املا / Script, Alphabet and Spelling, اسم، ضمیر اور صفت / Nouns, Pronouns and Adjectives, الفاظ، محاورے اور ضرب الامثال / Vocabulary, Idioms and Proverbs, تفہیمِ عبارت، انشا اور ترجمہ / Comprehension, Writing and Translation, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): শব্দার্থ, বাগধারা ও ভাষাশুদ্ধি / Meaning, Idioms and Correct Usage, বাক্য ও বাচ্য / Sentences and Voice, শব্দগঠন ও শব্দভান্ডার / Word Formation and Vocabulary, অনুবাদ, বোধপরীক্ষণ ও রচনা / Translation, Comprehension and Composition
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Verbs and Tenses, Pronoun, Verb, Adverb, Prepositions and Conjunctions, Parts of Speech, Determiner, Conjunction, Modals, Transformation of Sentences, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Structure and Common Errors, Reading Comprehension, Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: अनुपात और समानुपात / Ratio and Proportion, Divisibility Rules, मिश्रण और एलिगेशन / Mixture and Alligation, Permutation and Combination, संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Sequence and Series (Series), समय, चाल और दूरी / Time, Speed and Distance, श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, अशाब्दिक तर्क / Non-Verbal Reasoning, प्रतिशत / Percentage, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, Age Problems, Arithmetic, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Algebra, Probability, Trigonometry, Syllogisms, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, Analytical Reasoning (Counting Figures Reasoning), गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, कैलेंडर एवं घड़ी / Calendar and Clock, Clock, घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, Data Arrangement, Inequality, सादृश्यता एवं वर्गीकरण / Analogy and Classification, क्रम एवं रैंकिंग / Order and Ranking, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Biology, राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge, Chemistry, History, Geography, Indian Economy, Environment, समसामयिकी / 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): कंप्यूटर के मूल सिद्धांत / Computer Fundamentals, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications, व्यापार, विपणन एवं उपभोक्ता संरक्षण / Trade, Marketing and Consumer Protection, साइबर सुरक्षा / Cyber Safety and Security, कंप्यूटर सॉफ़्टवेयर / Computer Software, ऑपरेटिंग सिस्टम / Operating System, कंप्यूटर नेटवर्क / Computer Networks, वर्ड प्रोसेसिंग (MS Word) / Word Processing (MS Word), Terms & Abbreviations, प्रेज़ेंटेशन (MS PowerPoint) / Presentation Software (MS PowerPoint)
  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, OOPS with Java
  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.

The video delivers a detailed lecture on the Exclusive-OR (EX-OR) logic gate, covering its definition, truth tables, and fundamental Boolean properties. It begins by defining the 2-input EX-OR gate, where the output is high only if inputs differ, and presents the corresponding algebraic expression and truth table. The lesson then expands to a 3-input configuration, establishing the rule that the output is high when the count of high inputs is odd. Subsequently, the instructor derives four key properties involving constants and variables, such as the identity and complement laws. The session concludes with a rigorous algebraic demonstration of the commutative and associative laws for the EX-OR operation.

Chapters

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

    The instructor introduces the EX-OR gate with the on-screen text stating, 'For two inputs, output will be high if and only if both the input values are different.' He displays the algebraic formula $a \oplus b = a'.b + a.b'$ and a truth table with columns for Input A, Input B, and Output Y. He systematically fills the table, showing that inputs (0,0) and (1,1) yield 0, while (0,1) and (1,0) yield 1. To visualize this, he draws a Venn diagram with two overlapping circles, shading the non-overlapping regions to represent the symmetric difference. He also sketches the standard logic symbol for the EX-OR gate, noting the curved input side. The instructor points to the formula $a \oplus b = a'.b + a.b'$ to reinforce the algebraic representation.

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

    The lecture transitions to a 3-input EX-OR gate, with the slide text explaining, 'The XOR gate is a digital logic gate that gives High as output when the number of inputs High are odd.' A truth table for inputs A, B, and C is presented. The instructor fills the output column based on the odd-parity rule: for inputs (0,0,0) the output is 0; for (0,0,1) it is 1; for (0,1,0) it is 1; for (0,1,1) it is 0; for (1,0,0) it is 1; for (1,0,1) it is 0; for (1,1,0) it is 0; and for (1,1,1) it is 1. He writes the resulting sequence of outputs as 0, 1, 1, 0, 1, 0, 0, 1, emphasizing the pattern of odd numbers of 1s. He uses a pen to mark the 1s in the input columns to count them.

  3. 5:00 – 10:00 05:00-10:00

    The instructor details four specific properties of the EX-OR gate using a slide with numbered points. First, 'EX-OR with ZERO give same,' deriving $(a \oplus 0) = a'.0 + a.0' = 0 + a = a$. Second, 'EX-OR with ONE give comp,' deriving $(a \oplus 1) = a'.1 + a.1' = a' + 0 = a'$. Third, 'EX-OR with SAME give zero,' deriving $(a \oplus a) = a'.a + a.a' = 0 + 0 = 0$. Fourth, 'EX-OR with COMPLEMENT give one,' deriving $(a \oplus a') = a'.a' + a.a = a' + a = 1$. He also notes that the idempotent law does not apply, writing $(a \oplus a) eq a$. He begins proving the commutative law by writing $a \oplus b = a'b + ab'$ and showing it equals $b \oplus a$. The slide lists these properties as numbered points 1 through 4, with corresponding logic gate diagrams next to each equation.

  4. 10:00 – 11:27 10:00-11:27

    The final segment focuses on proving the associative law for EX-OR gates. The instructor writes the equation $((a \oplus b) \oplus c) = (a \oplus (b \oplus c))$ on the board. He proceeds to expand the left-hand side algebraically, substituting the definition of EX-OR into the expression. He writes out the full Boolean expansion, showing terms like $a'b'c + a'bc' + ab'c' + abc$. He performs similar expansion for the right-hand side to demonstrate that both sides result in the same set of minterms, thereby proving the associative property holds true for the EX-OR operation. The board becomes filled with red and black ink as he works through the complex algebraic steps.

The video provides a structured progression from basic definitions to complex algebraic proofs. It starts with the fundamental behavior of the 2-input gate, moves to the generalized 3-input parity check, and then solidifies understanding through specific properties involving constants and variables. The lesson culminates in formal proofs of commutativity and associativity, ensuring students understand not just how the gate works, but why it behaves according to Boolean algebra rules.

Loading lesson…