Variable Length SubNetting

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/computer-networks/net-layer-ip-addressing/subnetting-flsm-design/asset-variable-length-subnetting after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
  3. Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
  4. Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
  8. Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation 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 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
  9. Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
  10. Paper 2 | Programming and 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
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. Paper 2 | Theory Of Computation/Automata Theory: Introduction to TOC Deterministic FA (DFA) Non-Deterministic FA Regular Expressions Grammar Regular Language Properties Moore & Mealy Machines Pushdown Automata & CFG Turing Machines Complexity Theory
  13. 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
  14. 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
  15. Paper 2 | DataBase Management System/DBMS: 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 Database Recovery
  16. Paper 2 | Computer Networks: Introduction to CN 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
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces variable length subnetting (VLSM) by contrasting it with fixed-length subnetting, where all subnets share the same size and mask. The instructor presents a worked example: dividing network 200.1.2.0 into three subnets requiring 126 hosts and two of 62 hosts each. Using a pie-chart diagram, the largest subnet is allocated first: a /25 block (128 addresses) for 126 hosts, leaving two /26 blocks (64 addresses each) for the 62-host subnets. The final subnet assignments are 200.1.2.0/25, 200.1.2.128/26, and 200.1.2.192/26.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The lecture opens with a slide titled "Types of Subnetting" listing fixed length and variable length subnetting. Fixed-length subnetting is described as having all subnets of the same size, while variable length subnetting divides a network into subnets that are not of the same size, do not have equal numbers of hosts, and do not share the same subnet mask. The instructor then poses a question: given network 200.1.2.0, divide it into three subnets where the first contains 126 hosts and the other two contain 62 hosts each.

  2. 2:00 – 5:00 02:00-05:00

    The instructor moves to a whiteboard and draws a large circle representing the total address space of 256 addresses for the Class C network. The circle is split into a left half labeled "128" with a circled "126," and two right quarters each marked "64 64." On the margin, the calculation "256 - 2 = 254" is written to show usable hosts in the full block. The largest subnet is allocated first: 126 hosts require a /25 prefix (block size 128), and the remaining space is divided into two /26 subnets (block size 64) for the 62-host requirements. Binary representations of subnet masks are shown to illustrate boundaries.

  3. 5:00 – 6:19 05:00-06:19

    The instructor completes the subnet assignments. The first subnet is 200.1.2.0 with mask 255.255.255.128 (/25), accommodating 126 hosts. The second subnet starts at 200.1.2.128 with mask 255.255.255.192 (/26), and the third subnet starts at 200.1.2.192 with mask 255.255.255.192 (/26). The circular diagram visually confirms that the three subnets partition the original 256-address space without overlap, demonstrating the core VLSM principle of allocating the largest block first to preserve contiguous address space for smaller subnets.

The central teaching point is that VLSM allows a single network to be divided into subnets of different sizes, each with its own subnet mask. The method follows a strict order: allocate the largest host requirement first, then subdivide the remaining space. In the example, 126 hosts require a /25 (128 addresses), and each 62-host subnet requires a /26 (64 addresses). The key formula is block size = 2^(host bits), and usable hosts = block size - 2. The pie-chart diagram is the primary visual aid, showing how 128 + 64 + 64 = 256 fills the original network exactly. Students should remember that VLSM subnets must be listed in descending size order to avoid address overlap, and each subnet's network address is the start of its block.

Loading lesson…