CheckSum Part-2

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/computer-networks/dll-error-control/checksum-crc/asset-checksum-part-2 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
  3. Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
  4. Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
  8. Paper 2 | Digital Logic: 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
  9. Paper 2 | 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
  10. Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. Paper 2 | Theory Of Computation/Automata Theory: 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
  13. 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
  14. 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
  15. Paper 2 | DataBase Management System/DBMS: 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 Database Recovery
  16. Paper 2 | 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 Hardware Basics
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment, titled CheckSum Part-2, explains the one's complement checksum mechanism used in Internet protocols. The instructor begins by introducing a simple example using five 4-bit numbers: (7, 11, 12, 0, 6). The sender first calculates the arithmetic sum of these values, which is 36. However, because Internet protocols use one's complement arithmetic to handle data that exceeds the bit width, the sender does not simply send 36. Instead, it sends the negative (complement) of the sum, which is formally called the checksum. The lecture then transitions to a detailed sender/receiver diagram to demonstrate how wrapping and complementing are performed. At the sender site, the sum of 36 is wrapped (the carry bits are added back to the lower bits) to produce a wrapped sum of 6. The one's complement of this wrapped sum is then calculated, yielding the final checksum value of 9. The packet transmitted to the receiver therefore contains the sequence (7, 11, 12, 0, 6, 9). At the receiver site, the receiver sums all received values, including the checksum. The sum is 45. This value is then wrapped to produce a wrapped sum of 15. Finally, the one's complement of 15 is calculated, resulting in 0. A final checksum value of 0 at the receiver indicates that no errors were detected during transmission, confirming the integrity of the received data. The lecture uses binary representations in yellow detail panels to illustrate the specific wrapping and complementing steps, such as showing 10 0100 = 36 and 101101 = 45.

Chapters

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

    The instructor introduces the checksum concept using a slide headed 'CHECKSUM'. A specific example set of five 4-bit numbers, (7, 11, 12, 0, 6), is presented. The slide initially shows that the sender calculates a sum of 36, but then clarifies that to make the receiver's job easier, the sender actually transmits the negative (complement) of this sum. The on-screen text explicitly states: 'we send the negative (complement) of the sum, called the checksum', and displays the tuple (7, 11, 12, 0, 6, -36). The instructor uses handwritten circles and arrows to highlight the individual values in the sequence.

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

    The lecture introduces one's complement arithmetic as the method for handling data that exceeds the bit width. A new slide titled 'One's Complement' explains that a negative number is represented by inverting all bits. The instructor points to the binary representation of 36 and its wrapped sum within a yellow box detailing the wrapping process. A sender/receiver diagram is then used to illustrate the error detection process, showing how the sum of 36 is wrapped and complemented at both sites to manage overflow.

  3. 5:00 – 7:00 05:00-07:00

    A detailed side-by-side diagram demonstrates the full calculation. At the sender site, the sum of 36 is wrapped to 6 and complemented to find the checksum value of 9. The central packet box shows the transmitted sequence '7, 11, 12, 0, 6, 9'. At the receiver site, the sum including the checksum is 45. This wraps to 15 and complements to 0, indicating a successful transmission. Yellow panels captioned 'Details of wrapping and complementing' display binary rows such as 10 0100 = 36 and 101101 = 45, ending in 1001 (9) on the left and 1000 (0) on the right.

The core pedagogical goal of this segment is to bridge the gap between a simple arithmetic sum and the practical implementation of checksums in network protocols. The instructor effectively uses a concrete numerical example (7, 11, 12, 0, 6) to ground abstract concepts. The progression moves from the definition of a checksum as the negative complement of a sum, to the necessity of one's complement arithmetic for handling overflow (wrapping), and finally to a complete sender-receiver verification cycle. The key takeaway for students is that the checksum is not just a sum, but a wrapped and complemented value designed so that if the receiver performs the same operations on all received data (including the checksum), a result of zero confirms error-free transmission. The use of binary detail panels is crucial for students to understand the mechanical process of wrapping (adding carry bits) and complementing (inverting bits).

Loading lesson…