CheckSum Part-2

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/COCUBES-PREPARATION/computer-networks/dll-error-control/checksum-crc/asset-checksum-part-2 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude: Number System, Divisibility Rules, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Mixture and Alligation, Partnership, Age Problems, Time and Work, Pipe and Cistern, Speed Time and Distance, Algebra, Arithmetic, Data Interpretation, Sequence and Series (Series), Logarithm, Powers and Exponents (Surds and Indices), Permutation and Combination, Probability, Speed Mathematics and Basic Mathematics, Trigonometry
  2. Logical Reasoning: Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Syllogisms, Inequality, Data Sufficiency, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Venn Diagram, Logical Sequence Of Words, Calendar, Clock, Cubes & Dices, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Noun, Pronoun, Adjectives, Verb, Adverb, Tenses, Subject Verb Agreement (Verb Noun Agreement), Articles, Preposition, Conjunction, Modals, Determiner, Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Construction
  4. Data Structures (Domain Test): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  5. Algorithms (Domain Test):
  6. OOPs (Domain Test): Object Oriented Programming (OOPS)
  7. DBMS (Domain Test): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  8. SQL (Domain Test): SQL
  9. Operating Systems (Domain Test): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  10. Computer Networks (Domain Test): 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 Security, Cloud Computing and IoT, Cyber and Info Security
  11. Coding: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
  12. Written English Test: English Writing Ability
  13. Psychometric Test: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric 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…