Variable Length SubNetting

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-08-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. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | 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, Hardware basics
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research
  19. GS Paper | 05 | Elementary Maths: संख्या पद्धति / Number System, Divisibility Rules, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, प्रतिशत / Percentage, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, समय और कार्य / Time and Work, समय, चाल और दूरी / Time, Speed and Distance, Algebra, घन क्षेत्रमिति / Solid Mensuration, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), मिश्रण और एलिगेशन / Mixture and Alligation, Calculus, Trigonometry, Vectors, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, यूक्लिडीय ज्यामिति और क्षेत्रमिति / Euclidean Geometry and Mensuration, सांख्यिकी और प्रायिकता / Statistics and Probability, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers, समतल क्षेत्रमिति / Plane Mensuration, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: समसामयिकी / Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
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…