Implementing Full Adder Using Half Adder

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/CDAC-C-CAT-COMPLETE-PREPARATION/section-c-digital-electronics/combinational-circuit/adders-subtractors/asset-implementing-full-adder-using-half-adder after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Section A | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Preposition, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Articles, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Verbal Analogy (Word Based Analogy)
  2. Section A | Quant Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Arithmetic, Algebra, Powers and Exponents (Surds and Indices), Average, Age Problems, Percentage, Profit and Loss, Partnership, Time and Work, Simple Interest and Compound Interest, Mensuration and Geometry, Probability, Pipe and Cistern
  3. Section A | Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Calendar, Clock, Blood Relations, Directions (Direction Test), Seating Arrangements, Ranking, Order and Sequence, Puzzle Solving (Puzzles)
  4. Section B | C Programming: C Programming by Yash Sir, Coding Questions by Yash Sir
  5. Section B | Data Structures: Algorithm Analysis, Greedy Algorithms, Time Complexity Analysis, Sorting Algorithms, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs
  6. Section B | OOP (C++): Object Oriented Programming (OOPS), Programming in C++
  7. Section B | OS: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS
  8. Section B | Networking: 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
  9. Section B | AI & Big Data Basics: AI & ML by Arun Sir, Big Data Systems
  10. Section C | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  11. Section A, C | Comp. Fundamentals, COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  12. MOCK TEST:
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…