Fundamental of Adders

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/digital-electronics/combinational-circuit/adders-subtractors/asset-fundamental-of-adders after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: 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, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a comprehensive introduction to digital adders, fundamental components in computer architecture. The lecture begins by defining an adder as a digital combinational circuit designed to perform the addition of numbers, primarily utilized within Arithmetic Logic Units (ALUs). The instructor highlights various applications beyond simple addition, such as calculating memory addresses, determining table indices, and executing increment and decrement operators. The discussion then transitions to the number systems used, noting that while adders can be built for representations like binary-coded decimal (BCD) or excess-3, binary numbers are the standard. A crucial segment covers the modification of adders to perform subtraction using two's complement or ones' complement representations for negative numbers. Finally, the lecture visualizes the internal structure of a 4-bit adder, detailing the inputs, outputs, and the critical mechanism of carry propagation between bit stages.

Chapters

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

    The instructor introduces the core definition of an adder using a slide titled 'Adder'. He reads and underlines the text stating, 'An adder is a digital combinational circuit that performs addition of numbers.' He emphasizes their usage in 'arithmetic logic units or ALU' by underlining that specific phrase. He further explains that adders are utilized in other processor parts for tasks like 'calculate addresses, table indices, increment and decrement operators.' To illustrate the basic function, he writes 'A + B -> Add' on the whiteboard, visually representing the input operands and the resulting sum. This section establishes the fundamental role and utility of adders in digital systems.

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

    The lecture shifts to number representations and subtraction capabilities. The slide text mentions that adders can be constructed for 'binary-coded decimal or excess-3,' but the instructor notes that 'the most common adders operate on binary numbers.' He underlines these terms to distinguish them. The focus then moves to point 4 on the slide, discussing how 'two's complement or ones' complement is being used to represent negative numbers.' He explains that in these cases, it is 'trivial to modify an adder into an adder-subtractor.' To demonstrate this, he writes mathematical expressions on the board: 'A + B', '(+A) + (+B)', and '(+A) + (-B) = A - B', showing how adding a negative number equates to subtraction.

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

    The instructor draws a detailed diagram of a 4-bit adder to explain its internal architecture. The diagram shows two 4-bit inputs, labeled A3, A2, A1, A0 and B3, B2, B1, B0, along with a carry input C0 and carry outputs C1, C2, C3, C4. He circles the columns corresponding to each bit position to show how they are grouped. He draws arrows to indicate the flow of the carry signal, explaining that the carry out of one stage (e.g., C1) becomes the carry in for the next stage. He writes 'HF' and 'A0' near the least significant bit, likely referring to Half Adder or Full Adder logic at the first stage. This visual breakdown clarifies the ripple carry mechanism essential for multi-bit addition.

The video effectively progresses from the abstract definition of an adder to its practical applications and internal mechanics. It starts by establishing the adder's role in the ALU and processor, then addresses the data formats it handles, specifically binary and complement systems for signed arithmetic. The lesson culminates in a structural analysis of a 4-bit adder, illustrating how individual bit additions are chained together via carry propagation. This logical flow helps students understand not just what an adder is, but how it functions within a larger digital system to perform arithmetic operations.

Loading lesson…