Full Adder

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/digital-logic/combinational-circuit/adders-subtractors/asset-full-adder after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. Paper 2 | 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
  9. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS
  10. Paper 2 | Databases: 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
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | 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
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, 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, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, 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, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video provides a comprehensive lecture on the Full Adder, a fundamental component in digital logic design used for arithmetic operations. It begins by defining the Full Adder as a combinational circuit that sums three input bits: two operands (A and B) and a carry-in (Cin). The instructor explains that An and Bn represent the nth order bits of numbers A and B, while Cin is the carry generated from the addition of the (n-1)th order bits. The lecture progresses to illustrate carry propagation using a 4-bit adder diagram and binary addition examples. Finally, the instructor derives the Boolean logic for the Sum and Carry Out outputs using a truth table and Karnaugh maps, concluding with the implementation of the Full Adder using basic logic gates like XOR, AND, and OR. This structured approach ensures students understand both the theoretical basis and practical circuit design of the Full Adder.

Chapters

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

    The instructor introduces the Full Adder with on-screen text defining it as a 'combinational logic circuit that performs the arithmetic sum of three input bits.' He highlights the inputs An, Bn, and Cin, explaining that An and Bn are nth order bits while Cin is the carry from the (n-1)th order bits. He writes `( ) + ( )` on the board to visualize the addition process and labels the inputs A, B, and Cin. The text on the screen explicitly states 'It consists of three input bits, denoted by A (First operand), B (Second operand), Cin (Represents carry from the previous lower significant position).' The instructor circles the terms An and Bn in the text to emphasize their role as the current bits being added.

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

    The lecture transitions to practical examples, showing a 4-bit adder diagram with inputs A3-A0 and B3-B0, and carries C4-C0. The instructor circles specific columns to demonstrate how the carry output from one stage becomes the carry input for the next. He then displays a table of binary addition cases, such as `1+1+1` and `1+0+0`, calculating the results to show how sums and carries are generated in a multi-bit addition scenario. He writes down the binary results, for instance, writing `10` for the sum of `1+1+1` to indicate a sum of 0 and a carry of 1. This section emphasizes the concept of carry propagation where the carry obtained from the addition of two bits is added to the next higher order pair of significant bits.

  3. 5:00 – 8:31 05:00-08:31

    The instructor presents a truth table for the Full Adder with inputs A, B, Cin and outputs Sum, Cout. He uses K-maps to simplify the logic expressions, circling groups of 1s. He derives the Sum expression as `A'B'C + A'BC' + AB'C' + ABC`, which simplifies to `A XOR B XOR C`. For the Carry Out, he derives `AB + AC + BC`. The section concludes with a logic circuit diagram showing the interconnection of XOR, AND, and OR gates to implement the Full Adder. The K-maps are clearly visible with inputs labeled `ab`, `a'b'`, `a'b`, `ab`, `ab'` and `cin`, `cin'`. The final circuit diagram shows the Sum output connected to an XOR gate and the Carry output connected to an OR gate fed by three AND gates.

The video systematically builds the concept of the Full Adder from definition to implementation. It starts with the theoretical definition involving three inputs (A, B, Cin) and explains the role of carry propagation in multi-bit addition. The instructor uses visual aids like a 4-bit adder diagram and binary addition tables to clarify how carries move between bit positions. The core of the lecture involves deriving the logic equations: the Sum is the XOR of all three inputs, and the Carry Out is the majority function (AB + AC + BC). This is achieved through truth table analysis and K-map simplification. The final output is a complete logic circuit diagram, connecting the theoretical Boolean expressions to physical gate implementations, providing a full understanding of the Full Adder's structure and function. The lecture effectively bridges the gap between abstract logic definitions and concrete circuit design, ensuring students can both analyze and construct Full Adder circuits.

Loading lesson…