Example of Fragmentation
Duration: 5 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- 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
- 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
- Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- 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
- 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
- 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
- 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
- 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
- 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
- Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
- 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
- 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
- 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
- Coal India Previous Year Paper:
- Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
- Coal India Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture segment explains IP fragmentation using a concrete example involving two hosts with different Maximum Transmission Unit (MTU) constraints. Host A resides in Network X with an MTU of 520 bytes, while Host B is in Network Y with a smaller MTU of 200 bytes. The instructor visualizes the problem by drawing network boundaries and packet structures, demonstrating how a 520-byte packet from Host A must be fragmented to traverse Network Y. The core concept involves splitting the payload into chunks that fit the smaller MTU, accounting for a 20-byte IP header. The lecture details the calculation of fragment offsets and lengths, showing how a 500-byte payload is divided into fragments with specific data sizes (e.g., 176 bytes) and offsets derived by dividing the byte count by 8. The visual progression moves from defining the scenario to drawing diagrams, performing handwritten calculations for offsets (e.g., 176 / 8 = 22), and illustrating the final fragmented packets sent to Host B.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the networking problem involving Host A in Network X (MTU = 520 bytes) and Host B in Network Y. He draws a network boundary for Host A and illustrates data segmentation within the MTU limit, explicitly writing "Example: Consider host A is present in network X having MTU = 520 bytes." The visual setup includes the labels "X", "A", and the number "520" on screen, establishing the initial scenario where a large packet must be sent to a host with smaller network constraints.
2:00 – 5:00 02:00-05:00
The lecture focuses on the mechanics of IP fragmentation as a 520-byte packet is split to fit Network Y's MTU of 200 bytes. The instructor draws diagrams showing a 20-byte header plus data, calculating that the payload is divided into chunks like 176 bytes. Visible handwritten calculations include "= 176 / 8 = 22" to determine fragment offsets, and numbers like "352" and "148" representing data lengths. The whiteboard displays the progression from an initial 500-byte payload to three fragmented packets, with the instructor pointing to specific calculations to explain how data is distributed across fragments.
5:00 – 5:07 05:00-05:07
The segment concludes with the instructor summarizing the fragmentation process. The whiteboard shows the final state of three fragmented packets, with calculations for offsets and lengths visible. The instructor points to these fragmented packet calculations to illustrate how the original 500-byte payload is distributed. The screen displays labels "M=1" and the network identifiers "X", "Y", "A", "B", confirming the completion of the example where Host A's data is successfully segmented for Host B.
The video provides a step-by-step walkthrough of IP fragmentation, emphasizing the relationship between MTU sizes and packet segmentation. The instructor uses a specific numerical example (520 bytes vs 200 bytes) to make the abstract concept concrete. Key technical details include the 20-byte IP header overhead, the division of payload data into fragments that fit the smaller MTU, and the critical calculation of fragment offsets by dividing byte counts by 8. The visual evidence on the whiteboard, including numbers like "176", "352", and "22", supports the explanation of how data is split and reassembled. This example serves as a practical demonstration of network layer handling when packets exceed the MTU of an intermediate link.

