Full Subtractor

Duration: 33 min

This video lesson is available to enrolled students.

Return to /learn/MP-SET-COMPUTER-SCIENCE/unit-2-computer-system-architecture/combinational-circuit/adders-subtractors/asset-full-subtractor after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Paper - 1 | Unit - 1 | Teaching Aptitude: Concept and Objectives of Teaching / शिक्षण की अवधारणा एवं उद्देश्य, Levels of Teaching / शिक्षण के स्तर, Learner's Characteristics / शिक्षार्थी की विशेषताएँ, Learning: Nature and Theories / अधिगम: प्रकृति एवं सिद्धांत, Cognition, Memory and Metacognition / संज्ञान, स्मृति एवं अधिसंज्ञान, Factors Affecting Teaching / शिक्षण को प्रभावित करने वाले कारक, Effective Teaching and the Teacher / प्रभावी शिक्षण एवं शिक्षक, Instructional Objectives and Lesson Planning / अनुदेशनात्मक उद्देश्य एवं पाठ नियोजन, Methods of Teaching / शिक्षण विधियाँ, Offline and Online Teaching Methods / ऑफ़लाइन एवं ऑनलाइन शिक्षण विधियाँ, Teaching Support System / शिक्षण सहायक प्रणाली, Evaluation Systems / मूल्यांकन प्रणाली, Biological Basis of Emotion / संवेग का जैविक आधार, Central and Peripheral Nervous Systems / केन्द्रीय और परिधीय तंत्रिका तंत्र
  2. Paper - 1 | Unit - 2 | Research Aptitude: Research: Meaning, Features and Scientific Method / अनुसंधान: अर्थ, लक्षण व वैज्ञानिक विधि, Research Paradigms and Approaches / अनुसंधान के प्रतिमान एवं उपागम, Types of Research / अनुसंधान के प्रकार, Variables and Measurement / चर एवं मापन, Methods of Research / अनुसंधान की विधियाँ, Steps of Research / अनुसंधान के चरण, Sampling / प्रतिचयन, Tools and Methods of Data Collection / आँकड़ा संग्रह के उपकरण एवं विधियाँ, Data Analysis and Statistics in Research / आँकड़ा विश्लेषण एवं शोध सांख्यिकी, Thesis and Article Writing / शोध-प्रबंध एवं लेख लेखन, Application of ICT in Research / अनुसंधान में ICT का अनुप्रयोग, Research Ethics / शोध नैतिकता
  3. Paper - 1 | Unit - 3 | Comprehension: Literal Comprehension, Vocabulary and Language in Context, Inferential Comprehension, Critical Comprehension, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions)
  4. Paper - 1 | Unit - 4 | Communication: Communication: Meaning, Nature and Process / संचार: अर्थ, प्रकृति एवं प्रक्रिया, Types and Levels of Communication / संचार के प्रकार एवं स्तर, Verbal and Non-verbal Communication / मौखिक एवं अमौखिक संचार, Semiotics and Meaning / संकेत विज्ञान एवं अर्थ, Models and Theories of Communication / संचार के मॉडल एवं सिद्धांत, Effective Communication / प्रभावी संचार, Barriers to Communication / संचार की बाधाएँ, Classroom Communication / कक्षा संचार, Mass Media: Types and Evolution / जनसंचार माध्यम: प्रकार एवं विकास, Mass Media and Society / जनसंचार एवं समाज, Digital and New Media / डिजिटल एवं नव माध्यम, General Awareness (Legacy Paper 1) / सामान्य जागरूकता (पुराना पेपर 1)
  5. Paper - 1 | Unit - 5 | Mathematical Reasoning and Aptitude: Number System and Simplification / संख्या पद्धति एवं सरलीकरण, Algebra and Ages / बीजगणित एवं आयु, Percentage / प्रतिशतता, Ratio, Proportion, Partnership and Mixtures / अनुपात, समानुपात, साझेदारी एवं मिश्रण, Averages / औसत, Profit, Loss and Discount / लाभ, हानि एवं बट्टा, Simple and Compound Interest / साधारण एवं चक्रवृद्धि ब्याज, Time and Work / समय एवं कार्य, Speed, Time and Distance / चाल, समय एवं दूरी, Mensuration and Geometry / क्षेत्रमिति एवं ज्यामिति, Series / श्रेणी, Coding-Decoding / कूटलेखन-कूटवाचन, Relationships, Directions and Ranking / संबंध, दिशा एवं क्रम, Arrangements, Puzzles, Clock and Calendar / व्यवस्था, पहेलियाँ, घड़ी एवं कैलेंडर, Mathematical Foundations, जीवनी, Philosophy of the Constitution / संविधान का दर्शन, Analysis, Indian Polity and Governance (Legacy Unit 10) / भारतीय राजव्यवस्था और शासन (पुराना यूनिट 10)
  6. Paper - 1 | Unit - 6 | Logical Reasoning: Structure of Arguments / युक्ति की संरचना, Terms, Definitions and Uses of Language / पद, परिभाषा एवं भाषा के उपयोग, Categorical Propositions / निरुपाधिक प्रतिज्ञप्तियाँ, Categorical Syllogism / निरुपाधिक न्यायवाक्य, Venn Diagrams / वेन आरेख, Deduction, Induction and Analogy / निगमन, आगमन एवं सादृश्यता, Fallacies / तर्कदोष, Indian Logic: Pramanas / भारतीय तर्कशास्त्र: प्रमाण, Anumana and Vyapti / अनुमान एवं व्याप्ति, Hetvabhasa / हेत्वाभास, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Aristotle / अरस्तू, Western Schools of Philosophy / पाश्चात्य दर्शन की विचारधाराएँ, Kant / कांट, Sadhana Paada, Vaiśeṣika / वैशेषिक
  7. Paper - 1 | Unit - 7 | Data Interpretation: Data and Graphical Representation / आँकड़े एवं आलेखीय निरूपण, Data Interpretation: Tables / आँकड़ा निर्वचन: तालिका
  8. Paper - 1 | Unit - 8 | Information and Communication Technology: Computer Fundamentals and Hardware, Memory, Storage and Data Representation, Computer Software, Office Applications, Multimedia and File Formats, Computer Networks, Internet and World Wide Web, Email and Online Communication, Cyber Security, Digital Ethics, IPR and Society, Cloud and Distributed Computing, Emerging Technologies, ICT in Education and Governance, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Electronic Data Interchange and E-Commerce, Internet Fundamentals, Web Design & Development, Web Publishing & Hosting, Emerging Technologies, Terms & Abbreviations, Society, Law & Ethics, Keyboard Shortcuts, Website, Browser & Services, Protection of Geographical Indications / भौगोलिक संकेतों का संरक्षण
  9. Paper - 1 | Unit - 9 | People Development and Environment: Ecosystems and Biodiversity / पारितंत्र और जैव विविधता, Human and Environment Interaction / मानव और पर्यावरण की अंतःक्रिया, Development and Environment / विकास और पर्यावरण, Natural Resources – Forests, Water and Soil / प्राकृतिक संसाधन: वन, जल और मृदा, Energy Resources / ऊर्जा संसाधन, Air Pollution / वायु प्रदूषण, Water Pollution and Treatment / जल प्रदूषण और उपचार, Noise Pollution / ध्वनि प्रदूषण, Waste Management / अपशिष्ट प्रबंधन, Environmental Health and Toxicology / पर्यावरणीय स्वास्थ्य और विषविज्ञान, Climate Change and Global Environmental Issues / जलवायु परिवर्तन और वैश्विक पर्यावरणीय समस्याएँ, Natural Hazards and Disaster Management / प्राकृतिक प्रकोप और आपदा प्रबंधन, Indian Environmental Laws and Policies / भारतीय पर्यावरण कानून और नीतियाँ, International Environmental Agreements / अंतर्राष्ट्रीय पर्यावरण समझौते, Environment / पर्यावरण, Geography / भूगोल, Factory and Industry Systems / कारखाना और उद्योग व्यवस्थाएँ, Earth Materials, Surface Features and Processes, Communicable Diseases and Immunization / संक्रामक रोग और प्रतिरक्षण
  10. Paper - 1 | Unit - 10 | Higher Education System: Education in Ancient India / प्राचीन भारत में शिक्षा, Ancient Centres of Higher Learning / प्राचीन भारत के उच्च शिक्षा केंद्र, Colonial Education Policies and Commissions / औपनिवेशिक काल की शिक्षा नीतियाँ और आयोग, Colonial Colleges, Universities and Reformers / औपनिवेशिक कॉलेज, विश्वविद्यालय व सुधारक, Education Commissions and Policies after Independence / स्वतंत्र भारत में शिक्षा आयोग और नीतियाँ, National Education Policy 2020 / राष्ट्रीय शिक्षा नीति 2020, Types of Higher Education Institutions / उच्च शिक्षा संस्थानों के प्रकार, Learning Programmes and Academic Credits / अधिगम कार्यक्रम और अकादमिक क्रेडिट, Professional, Technical and Skill-Based Education / व्यावसायिक, तकनीकी और कौशल आधारित शिक्षा, Value Education and Environmental Education / मूल्य शिक्षा और पर्यावरण शिक्षा, Governance, Administration and Financing / शासन, प्रशासन और वित्तपोषण, Regulation, Accreditation and Ranking / उच्च शिक्षा का नियमन, प्रत्यायन और रैंकिंग
  11. Paper 2 | Unit 1 | Discrete Structures and Optimization: Propositional and Predicate Logic, Set Theory, Relations, Functions, Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Graph Theory, Group Theory, Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Optimization, Markov Chains
  12. Paper 2 | Unit 2 | Computer System Architecture: Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Basics of COA, Register Transfer and Microoperations, Programming the Basic Computer, Instr Formats & Modes, Control Unit Design, Pipelining, Input Output Organisation, Cache Memory Organization, Multiprocessors
  13. Paper 2 | Unit 3 | Programming Languages and Computer Graphics: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, HTML Basics, XML, JavaScript-Basics, Java, Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, OOPS with C++, Java Fundamentals, Array, String, IO & References, OOPS with Java
  14. Paper 2 | Unit 4 | Database Management Systems: 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, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  15. Paper 2 | Unit 5 | System Software and Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  16. Paper 2 | Unit 6 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Unit 7 | Data Structures and Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  18. Paper 2 | Unit 8 | Theory of Computation and Compilers: 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, 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
  19. Paper 2 | Unit 9 | Data Communication and Computer Networks: Introduction to CN, Data Communication, 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, Network Security, Cloud Computing, Mobile Computing
  20. Paper 2 | Unit 10 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Full Notes: Paper 1 Full Notes
  22. Paper 1 | Full Mock Tests:
  23. Paper 2 | Full Mock Tests:
  24. Paper 1 | Previous Year Papers:
  25. Paper 2 | Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces the full subtractor as a combinational logic circuit that performs arithmetic subtraction of three input bits: A (minuend), B (subtrahend), and B_{n-1} (borrow-in from the previous lower-significant position). The instructor begins with a slide definition and then uses a 4-bit binary example, A = 0110 and B = 1001, to motivate the need for borrow propagation. He labels MSB and LSB positions, highlights the least significant bit where a borrow is required (e.g., 10 - 1 = 1), and shows how subtraction proceeds bit by bit. A block diagram is drawn with inputs A, B, Bin and outputs D (difference) and Bout (borrow-out). The lecture then extends this to a multi-bit subtractor by cascading four full-subtractor stages labeled 0 through 3, with A = A3 A2 A1 A0 and B = B3 B2 B1 B0, showing how the borrow output of one stage feeds the borrow input of the next. A truth table is constructed with inputs A, B, Bin and outputs D, B (borrow), filled row by row using binary subtraction rules. From the truth table, minterm sums are written: D(A,B,Bin) = Σm(1,6,4,7) and B(A,B,Bin) = Σm(1,4,3,7). Finally, Boolean algebra simplification yields the standard full-subtractor equations: D = A ⊕ B ⊕ Bin and Bout = ĀB + (A ⊕ B)Bin. A final logic-gate diagram is drawn using XOR and OR gates to implement these expressions, completing the design of the full subtractor.

Chapters

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

    The lecture opens with a slide titled 'Full Subtractor' stating that it 'performs the arithmetic subtraction of three input bits.' The inputs are listed as A (Minuend) and B (Subtrahend), with a note that B_{n-1} represents the borrow from the previous lower-significant position. The instructor turns to the whiteboard and writes '(A - B)' followed by 'A = 0110' over 'B = 1001', setting up a concrete binary subtraction example to motivate the circuit design.

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

    The instructor explains the roles of minuend A, subtrahend B, and borrow-in Bin. He labels MSB and LSB on the board and walks through the subtraction example bit by bit, focusing on the least significant column where a borrow is needed. He writes '10 - 1 = 1' to demonstrate the borrow scenario and begins laying out a column subtraction with A and B rows under bit positions 3, 2, 1, 0.

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

    The instructor draws a green block diagram labeled 'Full Subtractor' with input arrows A, B, Bin and output arrows D and Bout, captioned 'Block Diagram.' He then extends this to a multi-bit representation, writing MSB: A3 A2 A1 A0 and LSB: B3 B2 B1 B0, and shows how the borrow input propagates through each bit position. He writes subtraction equations for individual bits, such as A0 - B0 = D0 and A1 - B1 - Bin1.

  4. 10:00 – 15:00 10:00-15:00

    The instructor builds a cascaded multi-bit subtractor by drawing red full-subtractor boxes. He starts with one box for bit 0 (inputs A0, B0, Bin0; output D0) and then adds a second box for bit 1 (inputs A1, B1, Bin1), showing how the borrow-out of one stage connects to the borrow-in of the next. The board also retains the '10 - 1 = 1' example and MSB/LSB labels as reference.

  5. 15:00 – 20:00 15:00-20:00

    The instructor completes the four-stage cascade, labeling boxes 'Full Subtractor (3)', '(2)', '(1)', and '0', with A = A3 A2 A1 A0 and B = B3 B2 B1 B0. He then transitions to logic design by drawing a green truth-table grid with column headers 'Inputs' (A, B, Bin) and 'Outputs' (D, B), beginning to fill in rows with 0s and dashes as he evaluates each combination.

  6. 20:00 – 25:00 20:00-25:00

    The instructor fills in the full truth table for the full subtractor, using binary subtraction rules such as '1 - 1 = 0' and lines beginning with '10 - 1' to determine output values for each input combination. Below the table, he writes minterm sums in pink: 'D(A,B,Bin) = Σm(1,6,4,7)' and 'B(A,B,Bin) = Σm(1,4,3,7)', identifying which input combinations produce a difference of 1 and a borrow-out of 1 respectively.

  7. 25:00 – 30:00 25:00-30:00

    The instructor applies Boolean algebra to simplify the minterm expressions. He shows steps for the borrow output, writing '= Bin(ĀA + AĀ) + ĀB' and then simplifying to '= ĀB + (A ⊕ B)Bin'. He also derives the difference output as 'D = A ⊕ B ⊕ Bin', using XOR identities to reduce the expressions to their minimal forms.

  8. 30:00 – 32:35 30:00-32:35

    The instructor draws the final logic-gate implementation of the full subtractor. He uses XOR gates to compute A ⊕ B and then (A ⊕ B) ⊕ Bin for the difference output D, and combines an AND gate with ĀB and (A ⊕ B)Bin fed into an OR gate for the borrow output Bout. The completed circuit diagram shows inputs A, B, Bin leading to outputs D and Bout, concluding the design.

The lecture follows a structured progression from motivation to implementation. It begins with the definition of a full subtractor and a concrete 4-bit binary example (A = 0110, B = 1001) to illustrate why borrow propagation is necessary. The instructor then abstracts this into a single-bit block diagram with inputs A, B, Bin and outputs D, Bout, before extending to a four-stage cascaded architecture for multi-bit subtraction. The core of the lecture is the truth-table construction, where all eight input combinations are evaluated using binary subtraction rules. From this table, minterm sums are extracted for both outputs: D = Σm(1,6,4,7) and Bout = Σm(1,4,3,7). Boolean algebra simplification then yields the canonical full-subtractor equations: D = A ⊕ B ⊕ Bin and Bout = ĀB + (A ⊕ B)Bin. The final gate-level diagram uses two XOR gates, one AND gate, and one OR gate to implement these expressions. Key takeaways for exam revision: (1) A full subtractor has three inputs and two outputs; (2) the difference output is a triple XOR of A, B, and Bin; (3) the borrow-out depends on both ĀB and the XOR of A and B multiplied by Bin; (4) multi-bit subtraction is achieved by cascading full subtractors with borrow chaining.

Loading lesson…