Super Netting in ClassFul Addressing

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/computer-networks-security/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. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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, Network Access Technologies, Network Security
  6. 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, 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, Waveform Generators and Timer 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
  7. 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
  8. Paper-2 | 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
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
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…