CheckSum Part-2

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/computer-networks-security/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-2 | Programming & 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
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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, Network Access Technologies, Network Security
  6. 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, 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, Waveform Generators and Timer 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
  7. 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
  8. Paper-2 | 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
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India 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…