Half Subtractor

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/GATE-GUIDANCE-BY-SANCHIT-SIR/digital-electronics/combinational-circuit/adders-subtractors/asset-half-subtractor after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  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
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  6. C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, 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
  10. 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
  11. 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
  12. Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics, Combinatorics
  13. General Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Mensuration and Geometry, Mental Ability, Arithmetic, Profit and Loss, Powers and Exponents (Surds and Indices), Average, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Syllogisms, Venn Diagram, Seating Arrangements, Blood Relations, Directions (Direction Test), Analogy, Algebra, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Cubes & Dices, Ranking, Order and Sequence, Mixture and Alligation, Age Problems, Clock, Selection Decision Table (Decision Making), Data Arrangement, Ratio and Proportion, Vocabulary, Averages, Mixtures and Alligation, Percentages, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Statistics, Three-Dimensional Patterns and Visualization, Permutations and Combinations, Trigonometry, Simplification and Approximation, Constraint Puzzles, Numerical Reasoning, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Direction Sense, Assembling and Grouping of Shapes, Cubes and Dice, Profit, Loss and Discount, Mensuration, Probability, Measurement and Quantity Take-Off, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Order, Ranking and Sequence, Logical Deduction and Induction, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Clocks and Calendars, Time and Work, Algebra, Data Interpretation, Speed, Time and Distance, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Calendar, Alphabet and Word Tests, Sequences and Series, Powers, Surds and Logarithms, Number System, Transformation of Shapes
  14. English (Verbal Aptitude): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Direct and Indirect Speech, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Verb, Articles, Adverb, Modals, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Articles and Determiners, Adjectives and Adverbs, Modals, Conditionals and Subjunctive, Voice and Reported Speech, Blood Relations, Tenses, Vocabulary
  15. Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
  16. Full Mock Test:
  17. Previous Year Papers:
  18. GATE 2026 Counselling: Counselling and Guidance Sessions
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces the Half Subtractor, a fundamental combinational logic circuit used for binary subtraction. The instructor begins by defining the concept as the simplest form of subtracting two single-bit binary numbers, identifying four elementary operations. A key distinction is made regarding the case where a borrow is required (when Minuend=0 and Subtrahend=1). The lesson progresses to defining the circuit's inputs (A: Minuend, B: Subtrahend) and outputs (D: Difference, B: Borrow). The instructor then develops a truth table for all input combinations and derives the corresponding Boolean expressions using minterms. The Difference output is simplified to an XOR function (D = A ⊕ B), while the Borrow output is expressed as D = A'B. Finally, the instructor begins mapping these expressions to a logic circuit diagram using an XOR gate and an AND gate.

Chapters

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

    The instructor introduces the Half Subtractor as a combinational logic circuit for subtracting two single-bit binary numbers. On-screen text lists the four elementary operations, specifically highlighting that a borrow is required when the minuend bit is 0 and the subtrahend bit is 1. The instructor writes binary subtraction equations on the whiteboard, including '0 - 0 = 0', '1 - 0 = 1', and '1 - 1 = 0'. The slide explicitly defines the inputs as A (Minuend) and B (Subtrahend), with outputs for Difference (D) and Borrow (B).

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

    The instructor transitions to a visual representation of the circuit by drawing green boxes on the whiteboard. A block diagram is created and labeled 'Half Subtractor (A-B)', with input arrows marked A and B leading to the box. The instructor then draws a truth table on the board, establishing headers for 'Inputs' (A, B) and 'Outputs' (D, B). This section focuses on the structural definition of the circuit before moving into logical derivation.

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

    The instructor completes the truth table by filling in the 0/1 rows for all input combinations. Using minterm notation, he derives the Boolean expressions: D(A,B) = Σm(1,3) and B(A,B) = Σm(1). The Difference expression is simplified to A'B + AB', which the instructor identifies as the XOR operation (D = A ⊕ B). The Borrow expression is simplified to A'B. The instructor then begins drawing the logic circuit diagram, starting with an XOR gate for the Difference output.

  4. 10:00 – 10:47 10:00-10:47

    The instructor reviews the completed logic design, pointing to the handwritten equations on the board. The final expressions are clearly visible: 'D = A ⊕ B' and 'B = ĀB'. The instructor gestures toward the truth table and the circuit components, reinforcing the relationship between the binary subtraction operations and their corresponding logic gate implementations.

The lecture follows a standard digital design progression: from arithmetic definition to logical implementation. The core takeaway is that the Half Subtractor requires two distinct logic functions: an XOR gate for the Difference and an AND gate (with one inverted input) for the Borrow. The instructor emphasizes that while most binary subtractions are straightforward, the 0-1 case necessitates a borrow from a higher-order bit. This circuit serves as the building block for more complex subtractors like the Full Subtractor.

Loading lesson…