Basics of Fragmentation
Duration: 6 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 introduces IP datagram fragmentation, a critical mechanism in computer networking that allows large packets to traverse networks with smaller Maximum Transmission Units (MTUs). The instructor establishes the fundamental rule that while fragmentation can occur at any point in the path—either by the source host or intermediate routers—the reassembly of these fragments is exclusively performed by the destination host. This distinction ensures that each fragment travels as an independent datagram, potentially taking different routes through the network. The session progresses from conceptual definitions to visual demonstrations of fragmentation at routers, followed by a technical breakdown of the IP header fields required to manage this process.
Chapters
0:00 – 2:00 00:00-02:00
The lecture begins with a definition of fragmentation as the process of dividing a datagram into smaller fragments during transmission. The instructor emphasizes that reassembly occurs only at the destination host because each fragment becomes an independent datagram. A diagram is drawn showing a source (S) and destination (D), illustrating that fragmented datagrams can travel through different routes. On-screen text confirms the rule: 'The reassembly of the datagram, is done only by the destination host.' The instructor visually demonstrates a large datagram labeled 'R0 540B' at the source, setting up the context for how size constraints necessitate splitting data.
2:00 – 5:00 02:00-05:00
The instructor illustrates the fragmentation process at an intermediate router, specifically Router N1. A large datagram of size 3540B originating from source S is shown being split to fit the MTU of the next hop. The visual progression shows arrows indicating how these fragments are routed towards destination D. The instructor points to the routers and writes '200B' below N1, indicating a link capacity constraint. The slide reinforces that the fragmented datagram can travel through different routes. This section visually demonstrates how a 3540B packet is divided into smaller fragments, such as 1800B and a remainder, to accommodate network limitations.
5:00 – 6:05 05:00-06:05
The focus shifts to the technical implementation of fragmentation using IP header fields. The instructor explains the 'Flag Field', a 3-bit field defining three flags: reserved, Don't Fragment (DF), and More Fragments (MF). The slide text specifies that if the DF bit is set to 1, 'the machine must not fragment the datagram.' The MF bit indicates if more fragments follow (1) or if it is the last fragment (0). The instructor draws arrows to show a 200B datagram being fragmented into smaller units like 180B and 20B as it traverses a network with an MTU of 100B, eventually reaching destination D. This section connects the conceptual diagram to specific header control bits.
The lecture effectively bridges the gap between high-level network concepts and low-level packet implementation. The progression moves from defining fragmentation as a necessity for traversing heterogeneous networks to demonstrating the physical splitting of datagrams at routers. The instructor uses visual aids, such as drawing arrows and labeling sizes like '3540B' or '200B', to make abstract constraints concrete. A critical takeaway is the separation of concerns: routers handle fragmentation for efficiency, while destination hosts handle reassembly to ensure data integrity. The final segment on the IP header flags provides the mechanism for controlling this behavior, specifically highlighting how the DF and MF bits dictate whether fragmentation is allowed and how fragments are ordered. This structure ensures students understand both the 'why' (MTU constraints) and the 'how' (header flags) of IP fragmentation.

