EX OR gate
Duration: 11 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
- Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and 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
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: 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
- Paper 2 | 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
- Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
- Paper 2 | DataBase Management System/DBMS: 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
- Paper 2 | 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
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
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
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: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.
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.
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.

