SubNetting In CIDR

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/HPSC-PGT-COMPUTER-SCIENCE/computer-networks/net-layer-ip-addressing/cidr-vlsm/asset-subnetting-in-cidr after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. HPSC Interview Preparation: Interview Preparation
  2. Python Language: 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
  3. Data Structure & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Sorting Algorithms, Minimum Spanning Trees, Time Complexity Analysis, Graph Theory, Shortest Path Algos
  4. Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security
  5. Computer System & Organisation: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  6. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Transaction Management, Concurrency Control
  7. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling
  8. Digital Logic & Circuits: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  9. Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Pushdown Automata & CFG, Turing Machines, Moore & Mealy Machines
  10. 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
  11. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Data Warehousing & Mining
  12. Introduction to Emerging Trends: Emerging Tech Trends, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, व्यापार, विपणन एवं उपभोक्ता संरक्षण / Trade, Marketing and Consumer Protection, कंप्यूटर नेटवर्क / Computer Networks
  13. Digital Society & Cyber Law: Society, Law & Ethics, साइबर सुरक्षा / Cyber Safety and Security
  14. HPSC PGT Previous Year Paper:
  15. HPSC Assistant Professor Previous Year Paper:
  16. Live Sessions: HPSC Live Sessions, EMRS TGT/PGT Live Class
  17. Full Mock Test:
  18. HPSC PGT - MOCK Test Series:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture demonstrates subnetting in CIDR by dividing the network 20.30.40.10/25 into two subnets. The instructor writes the network address, converts it to binary, and identifies the host bits available after the /25 prefix. By borrowing one additional bit from the host portion, the original network is split into two /26 subnets. The first subnet is shown as 20.30.40.0/26, while the second is indicated as 20.30.40.128/26, with binary rows and circled bits used to show the subnet bit transition. The board also displays power-of-two values, including 2^7 = 128 and 2^6 = 64, supporting the calculation of address ranges. The final visible evidence shows a circle divided into two halves representing the two resulting subnets, with tally marks or host-bit placeholders along the bottom. The lesson focuses on practical CIDR subnet division, binary representation, and deriving new network addresses from a single borrowed bit.

Chapters

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

    The instructor introduces the problem under the header “Subnetting in CIDR,” asking students to divide the network having IP address 20.30.40.10/25 into two subnets. The network address is written on the board, and a large circle is drawn in the center as a visual aid. The instructor then begins converting parts of the address into binary, writing “0000” after an underlined address and placing “20.30.40” on the right side of the board, setting up the binary analysis needed for subnetting.

  2. 2:00 – 4:17 02:00-04:17

    The instructor writes binary representations of the address on both sides, circling specific bits to show which host bit is borrowed for subnetting. The resulting network addresses are derived, with “20.30.40.0” written for the first subnet and a second address beginning with “20.30.40.1” shown for the other half. The central circle is split into two halves, labeled “20.30.40.0/26” on the left and a second /26 address on the right, later visible as “20.30.40.128.” The board also shows “2^7 = 128” and “2^6 = 64,” indicating the size calculations used to determine subnet boundaries.

The core teaching point is how a /25 network can be divided into two smaller subnets by borrowing one host bit, producing two /26 networks. The instructor uses binary notation to make the subnet bit explicit: after the original 25 network bits, one additional bit is taken from the host portion to create two possible values. This yields 20.30.40.0/26 and 20.30.40.128/26, with the value 128 coming from the binary weight of the borrowed bit. The circle diagram visually separates the original network into two halves, reinforcing that one subnet uses a 0 in the borrowed bit and the other uses a 1. The displayed powers of two, especially 2^7 = 128 and 2^6 = 64, connect the binary bit position to address range sizes. For exam revision, students should remember that increasing the prefix length by one bit doubles the number of subnets and halves the host space, while the new network addresses are found by setting borrowed subnet bits to 0 or 1 and host bits to 0.

Loading lesson…