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 the course: About the Course
- Mathematical Aptitude: संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Divisibility Rules, प्रतिशत / Percentage, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय, चाल और दूरी / Time, Speed and Distance, Age Problems, मिश्रण और एलिगेशन / Mixture and Alligation, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Pipe and Cistern, Trigonometry, Statistics, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
- Logical Reasoning: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, सादृश्यता एवं वर्गीकरण / Analogy and Classification, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, क्रम एवं रैंकिंग / Order and Ranking, अशाब्दिक तर्क / Non-Verbal Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, Syllogisms, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Analytical Reasoning (Counting Figures Reasoning), घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, कैलेंडर एवं घड़ी / Calendar and Clock, Clock
- General Knowledge: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Chemistry, Biology, History, Geography, Polity, Indian Economy, समसामयिकी / Current Affairs, Static General Knowledge, राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge
- Art of Teaching: शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, आकलन एवं मूल्यांकन / Assessment and Evaluation, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development, शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन / Educational Policies, Acts and Administration, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, निर्देशन एवं परामर्श / Guidance and Counselling, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, Micro-Teaching & Teaching Skills, पाठ योजना / Lesson Planning
- Environmental Science: Environment
- Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
- Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
- Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
- Unit 6 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Transaction Management, Concurrency Control
- Unit 7 | Computer Networks: 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
- Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Unit 9 | Object Oriented Programming: OOPS with C++
- Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js, Git & Github, PHP
- Unit 11 | 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
- Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, कंप्यूटर नेटवर्क / Computer Networks, Internet of Things
- Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
- Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
- Unit 15 | Multimedia: Multimedia
- Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
- Full Length Mock Tests — General Paper:
- Full Length Mock Tests — Computer Science (Paper II):
- Full Length Mock Test – General + Computer Science:
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.