Implementing Full Adder Using Half Adder

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-SENIOR-COMPUTER-INSTRUCTOR/paper-2-digital-logic-systems/combinational-circuit/adders-subtractors/asset-implementing-full-adder-using-half-adder after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Paper-1 & 2 | Basic Numeracy: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Mensuration and Geometry, Age Problems, Arithmetic, Statistics, Probability, Profit and Loss, Simple Interest and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, Powers and Exponents (Surds and Indices), Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy
  3. Paper-1 & 2 | Data Interpretation: Data Interpretation
  4. Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Analogy, Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement, Logical Sequence Of Words, Crypt Arithmetic
  6. Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
  7. Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
  8. Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
  9. Paper-2 | Fundamentals of Computer: Basics of COA, Number System, Floating Point Rep, Number Representation
  10. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits
  11. Paper-2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Linux OS, Distributed Systems
  12. Paper-2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  13. Paper-2 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  15. Paper 2 | Oops, C++, Java: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  16. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  17. Paper 2 | Emerging Trends and AI: Emerging Tech Trends, Artificial Intelligence
  18. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Advanced Algorithms
  19. Paper 2 | Data Communication and Network Security: 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, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Ethical Hacking
  20. Paper-2 I Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  21. Paper-2 | Computer Organization and Architecture: Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations
  22. Paper-2 | Web Development: JavaScript-Basics, HTML Basics, CSS, XML
  23. Pedagogy: Child Development, Concept of Pedagogy, Psychology, Theories, Inclusive Education, Experiential Pedagogy, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
  24. Live Sessions: RSSB Live Sessions
  25. RSSB Paper 1 - Full Mock Tests:
  26. RSSB Paper 2 - Full Mock Tests:
  27. SCI Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video delivers a detailed tutorial on the Full Adder, a fundamental component in digital logic circuits used for binary addition. The instructor systematically breaks down the Full Adder by first constructing it from two Half Adders and an OR gate. He then delves into the Boolean algebra required to describe its operation, deriving the specific logic equations for the Sum and Carry outputs. The lecture concludes by presenting the complete truth table and the final logic gate schematic, providing a holistic view of the circuit's design and function.

Chapters

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

    The instructor begins by analyzing the block diagram of a Full Adder. He identifies two main blocks labeled Half Adder. The first Half Adder accepts inputs A and B, producing a SUM output and a CARRY output. The SUM output from the first block is routed to the A input of the second Half Adder, while the carry-in signal (Cin) is routed to the B input of the second Half Adder. The final Sum output (S) is taken from the second Half Adder. The final Carry out (Cout) is generated by an OR gate that takes the CARRY output from the first Half Adder and the CARRY output from the second Half Adder as its inputs. The instructor uses a pen to trace these connections and places checkmarks on the diagram to confirm the correct wiring.

  2. 2:00 – 4:25 02:00-04:25

    The focus shifts to the logic gate level implementation. The instructor writes the Boolean expression for the Sum output as A XOR B XOR Cin. He then derives the Carry out expression, starting with the formula (A XOR B)Cin + AB. He expands the XOR term (A XOR B) into its sum-of-products form (A'B + AB'), resulting in the full expression A'BCin + AB'Cin + AB. A truth table is displayed on the screen with columns for Inputs (A, B, Cin) and Outputs (Sum, Cout), listing all eight possible binary combinations. The video concludes by showing the final logic circuit diagram using XOR, AND, and OR gates, followed by a simulation view where specific inputs are applied to demonstrate the output values.

The lecture effectively builds understanding of the Full Adder by moving from abstract blocks to concrete logic. The initial block diagram approach simplifies the complex circuit into manageable Half Adder units. The subsequent derivation of Boolean equations provides the mathematical foundation for the circuit's behavior. By expanding the Carry expression, the instructor highlights the conditions under which a carry is generated. The truth table serves as a verification tool for the derived equations, and the final circuit diagram ties everything together, showing exactly how the logic gates are interconnected to perform the addition operation. This comprehensive approach ensures students grasp both the structural and functional aspects of the Full Adder, preparing them for more complex arithmetic circuits.

Loading lesson…