Variable Length SubNetting

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/computer-network-and-information-security/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 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. 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, 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 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
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…