Super Netting in ClassFul Addressing

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/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. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. 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
  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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, 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, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
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…