Half Subtractor

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/digital-electronics/combinational-circuit/adders-subtractors/asset-half-subtractor after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. 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
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: 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
  4. 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
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. Theory Of Computation: 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
  10. 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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
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…