Excess 3 Code
Duration: 8 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- Computer Networks: Introduction to CN, 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, Network Security, Hardware Basics
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
- Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
- 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
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
- Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, 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, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
- English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video provides a detailed lecture on Excess-3 code, a specific type of binary-coded decimal (BCD) system. The instructor defines it as a self-complementary, biased representation often abbreviated as XS-3 or Stibitz code. The lesson covers the fundamental encoding method where each decimal digit is converted to its 4-bit binary equivalent and then added to 3 (0011). Through various examples, including single digits and multi-digit numbers like 127, the instructor demonstrates the encoding process. The lecture concludes by exploring the unique properties of Excess-3, specifically its self-complementing nature where the 9's complement is found via bitwise inversion, and the specific arithmetic rules required to correct sums that result in an Excess-6 bias.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a title slide "Excess-3 Code" and introductory text defining it as a self-complementary binary-coded decimal (BCD) code and numeral system. The instructor highlights the text "XS-3, 3XS or X3" and writes these abbreviations on the screen. He points out that it is a biased representation and mentions its historical use in older computers and 1970s calculators. A table is visible on the right, listing Decimal digits 0 through 9 alongside their Excess-3 binary equivalents, such as 0 mapping to 0011 and 9 mapping to 1100. The instructor begins a practical demonstration by writing "decimal 0" on the board. He converts this to standard BCD "0000" and then adds binary "0011" (which represents decimal 3) to arrive at the final Excess-3 code "0011". This establishes the core rule that Excess-3 is simply BCD plus 3.
2:00 – 5:00 02:00-05:00
The instructor continues with further encoding examples to reinforce the concept. He writes "decimal 2" and converts it to BCD "0010". He adds "0011" to this value, resulting in the Excess-3 code "0101". He then moves to a more complex example, the number 127. He breaks the number down into its constituent digits: 1, 2, and 7. For the digit 1, he writes BCD "0001" and adds "0011" to get "0100". For the digit 2, he uses BCD "0010" plus "0011" to get "0101". For the digit 7, he uses BCD "0111" plus "0011" to get "1010". He combines these results to show the full Excess-3 representation of 127 as "0100 0101 1010". During this process, he writes "unweighted" and "self complementing" on the board to describe the code's characteristics. He also notes that Excess-3 arithmetic uses different algorithms than normal BCD.
5:00 – 8:17 05:00-08:17
The final segment focuses on the self-complementing property and arithmetic correction. The instructor explains that for self-complementing codes, the 9's complement of a decimal number is obtained directly by changing 1s to 0s and 0s to 1s. He uses the example of the decimal number 395. He writes its Excess-3 representation as "0110 1100 1000". He calculates the 9's complement as 999 - 395 = 604. He then shows that the Excess-3 code for 604 is "1001 0011 0111". By visually comparing the two codes, he demonstrates that the Excess-3 code for 604 is the bitwise complement of the Excess-3 code for 395. Finally, he addresses the arithmetic aspect, stating that after adding two Excess-3 digits, the raw sum is Excess-6. To correct this, it is necessary to remove the extra bias by subtracting binary "0011" (decimal 3 in unbiased binary).
The lecture progresses logically from definition to application to advanced properties. It starts by defining Excess-3 as a biased BCD code and establishing the "BCD + 3" encoding rule. It then applies this rule to single and multi-digit numbers, showing the step-by-step binary addition. Finally, it deepens the understanding by explaining the self-complementing property, proving it with the 395/604 example, and clarifying the specific arithmetic adjustments needed for addition, ensuring students grasp both the theoretical and practical aspects of the code.

