Super Netting in ClassFul Addressing

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/HPSC-PGT-COMPUTER-SCIENCE/computer-networks/net-layer-ip-addressing/supernetting-spl-ips/asset-super-netting-in-classful-addressing 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.

The lecture introduces super netting in classful addressing as a method to combine multiple Class C blocks into a larger supernet, addressing the limitation that a single Class C block (256 addresses) is often insufficient for organizations. The instructor explains that super netting decreases the number of 1s in the subnet mask and contrasts it with subnetting, which increases routing table size. A hand-drawn diagram of four small circles enclosed by a larger circle illustrates the concept of combining blocks. The lecture then transitions to CIDR aggregation, presenting three rules: networks must be contiguous, all network sizes should be the same, and the first net ID should be divisible by the size of the block. A worked example performs CIDR aggregation on four /24 addresses (128.56.24.0/24 through 128.56.27.0/24). The instructor writes binary expansions of these addresses, identifies differing bits by drawing a vertical line and circling them, and begins deriving the aggregated prefix. The final visible result on the board is 128.56.24.0/32, though this appears to be an intermediate or partially visible step in the aggregation process.

Chapters

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

    The slide titled 'Super netting in Classful addressing' introduces the concept, noting that a Class C block with 256 addresses did not satisfy most organizations' needs. The instructor explains that an organization can apply for a set of Class C blocks instead of just one, forming a 'super network or a supernet.' A hand-drawn diagram appears showing four small circles enclosed by a larger circle, visually representing the combination of blocks. The slide also states that 'Super netting decreases the number of 1s in the mask,' which is underlined for emphasis.

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

    The instructor elaborates on the slide content, with red pen underlines added to key phrases such as 'increase size of routing table' and 'super netting.' The slide contrasts subnetting, which increases routing table size, with super netting as a counter idea. The instructor then transitions to a new slide titled 'Super netting / Aggregation with CIDR,' presenting three rules: all networks should be contiguous, the size of all networks should be the same, and the first net ID should be divisible by the size of the block. The instructor introduces a practical example asking to perform CIDR aggregation on four /24 IP addresses, beginning with '128.56.24.0/24' and '128.56.25.0/24.'

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

    The instructor writes binary expansions of the four listed /24 addresses (128.56.24.0/24, 128.56.25.0/24, 128.56.26.0/24, and 128.56.27.0/24) on the whiteboard. He draws a vertical line through the differing bits of each binary row and circles those bits, with an arrow pointing to the right, indicating where the prefix changes. At the bottom of the board, he writes '128.56.24.0/32' with a small red mark beside it, which appears to be part of the aggregation derivation process. The instructor gestures toward the binary rows with an open hand, emphasizing the bit-level analysis required for CIDR aggregation.

The lecture progresses from conceptual introduction to practical application. It begins by establishing the motivation for super netting: Class C blocks are too small for many organizations, so multiple blocks can be combined into a supernet. The key mechanism is reducing the number of 1s in the subnet mask, which expands the address range. The visual diagram of nested circles reinforces this idea. The lecture then formalizes the process through CIDR aggregation rules, ensuring that networks are contiguous, uniform in size, and properly aligned. The worked example demonstrates the bit-level analysis: by comparing binary representations of consecutive /24 addresses, the instructor identifies the common prefix and determines the aggregated network. The final visible result of 128.56.24.0/32 suggests the instructor is working through the prefix length determination, though the exact final aggregated prefix may not be fully visible in the sampled screenshots. The teaching flow moves from 'why' (organizational needs) to 'how' (CIDR rules and binary analysis), providing a structured approach to network aggregation.

Loading lesson…