Half Adder

Duration: 8 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-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 lecture introduces the fundamental building blocks of digital arithmetic, specifically focusing on the Half Adder. The instructor begins by explaining the necessity of hierarchical design in circuit development, moving from simple half adders to full adders and finally to n-bit adders. To clarify the concept of "carry," he uses a base-9 addition example (768 + 557), demonstrating how remainders and quotients work in different bases. The lesson then transitions to binary logic, outlining the four elementary addition operations. The core of the lecture defines the Half Adder circuit, detailing its inputs (A, B) and outputs (Sum, Carry), and presents its truth table and corresponding logic gate implementation using XOR and AND gates.

Chapters

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

    The video begins with a slide titled "Why we need a half adder". The text defines a binary adder-subtractor as a combinational circuit performing arithmetic operations. The instructor explains the hierarchical design approach, stating, "The half adder design is carried out first, from which we develop the full adder." He writes "Basics of addition: (A)x + (B)x = ?" on the screen. To illustrate the concept of carry, he sets up an addition problem in base 9: 768 + 557. He explains that in base 9, digits range from 0 to 8. He begins the calculation by adding the rightmost digits, 8 and 7. He notes that 8 + 7 equals 15 in decimal. Since the base is 9, he explains that 15 divided by 9 gives a quotient of 1 and a remainder of 6. This sets up the concept of carrying over a value to the next significant bit, which is fundamental to digital addition. He writes the remainder 6 at the bottom and carries the 1.

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

    Continuing the base 9 example, the instructor calculates the middle column: 6 + 5 plus the carry of 1. This sums to 12 in decimal. In base 9, 12 is represented as 13 (1 carry, 3 remainder). He writes the carry '1' above the next column. Finally, he adds the leftmost column: 7 + 5 plus the carry of 1, which equals 13 in decimal. In base 9, this is 14. The final result is written as 1436. The instructor then transitions to binary addition. A new slide appears titled "Half adder". It lists the four elementary operations: 0+0=0, 0+1=1, 1+0=1, and 1+1=10. He emphasizes that the first three operations produce a single digit sum, but 1+1 produces a two-digit result (10 binary), where the higher significant bit is called a carry. This distinction is crucial for understanding how digital circuits handle overflow. He writes the binary addition table on the board, showing 0+0, 0+1, 1+0, and 1+1.

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

    The lecture formally defines the Half Adder. The slide states it is a combinational circuit that performs the arithmetic addition of two one-bit binary numbers. The inputs are labeled A and B, and the outputs are Sum (S) and Carry (C). The instructor fills out the truth table: for inputs 0 and 0, Sum is 0 and Carry is 0. For 0 and 1, Sum is 1 and Carry is 0. For 1 and 0, Sum is 1 and Carry is 0. For 1 and 1, Sum is 0 and Carry is 1. He then displays the logic circuit diagram. The Sum output is generated by an XOR gate, while the Carry output is generated by an AND gate. He points out that this circuit has no provision for a carry coming from a previous stage. The final frame shows a block diagram of a 4-bit adder, illustrating how multiple adders are connected in cascade to handle multi-bit numbers, labeled A(A3 A2 A1 A0) and B(B3 B2 B1 B0). He gestures towards the carry lines connecting the stages.

The video provides a comprehensive introduction to digital arithmetic circuits, logically progressing from general concepts to specific implementations. By using a base-9 example, the instructor effectively demystifies the concept of "carry" before applying it to binary logic. The lesson culminates in defining the half adder's truth table and logic gates, setting the stage for more complex circuits like the full adder and n-bit adders. This structured approach ensures students understand the underlying mechanics of binary addition before moving to circuit design.

Loading lesson…