Variable Length SubNetting
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 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
- Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
- Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
- Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
- Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- 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 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS
- Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
- Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Paper 2 | 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
- Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
- Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
- Paper 2 | Cloud Technology: Cloud Computing
- Paper 2 | Probability and statistics: Probability, Statistics
- Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
- Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Analogy
- Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
- Full Length 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
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: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.
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.