CIDR supernetting

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/RPSC-PROGRAMMER/paper-1-data-communication-network/net-layer-ip-addressing/supernetting-spl-ips/asset-cidr-supernetting after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Paper 1 | Reasoning Test: 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, Puzzle Solving (Puzzles), Venn Diagram, Analogy, Ranking, Order and Sequence, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning), Calendar, 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, Direction Sense, Algebra, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Profit, Loss and Discount, Constraint Puzzles, Speed, Time and Distance, Traverse Surveying, Ratio and Proportion, Time and Work, Mensuration, Permutations and Combinations, Clocks and Calendars, Data Interpretation, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Blood Relations, Data Sufficiency
  2. Paper 1 | Numerical Analysis: Number System, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Algebra, Statistics, Data Interpretation, Mental Ability, Arithmetic, Logarithm, Profit and Loss, Simple Interest and Compound Interest, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Permutation and Combination, Probability, Sequences and Series, Powers, Surds and Logarithms, Subject-Verb Agreement, Sentence Completion, Geometry, Sentence Structure and Correction, Data Sufficiency, Trigonometry, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Probability, Statistics, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Graph Theory, Combinatorics
  3. Paper 1 | General Knowledge: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge, Polity, Indian Economy
  4. Paper 1 | DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Transaction Management, Concurrency Control, Relational Calculus, Database Security & Authorization, Database Recovery
  5. Paper 1 | Data Communication & Network: 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, Network Security, Security in Mobile and Wireless Computing, Input Output Organisation, File Management, Hardware Basics, Terms & Abbreviations, Protocols & Services, Network Access Technologies, Cyber Safety and Security, Basics of COA
  6. Paper 2 | System Analysis & Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Security, Risk Management & Maintenance, extras
  7. Paper 2 | Programming Language (Java): Java Fundamentals, OOPS with Java, Array, String, IO & References, Generic & Collections, Multithreading, Java, Miscellaneous, Control Flow, OOPS with C++, Stack, C Fundamentals, Arrays & Pointers, Object Oriented Technology, Control Flow & Looping, Introduction to Python
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture provides a detailed walkthrough of supernetting within the context of Classless Inter-Domain Routing (CIDR). The instructor presents a specific problem requiring the aggregation of three distinct IP networks: 100.1.2.0/25, 100.1.2.128/26, and 100.1.3.192/26. The primary objective is to merge these networks into a single, larger supernet. The session begins by establishing the theoretical framework, where the instructor writes down the essential rules for supernetting on the whiteboard. He emphasizes that for networks to be merged, they must be contiguous in address space, and the starting network ID must be divisible by the total block size. The instructor then methodically analyzes each network, calculating their individual IP ranges and block sizes to verify these conditions. He utilizes binary conversion to identify the common prefix bits, which is the critical step in determining the correct subnet mask for the new supernet. The lecture concludes with the derivation of the final supernet address, demonstrating a practical application of CIDR aggregation principles.

Chapters

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

    The video begins with a slide showing the problem statement: "Consider the following networks and merger them to have a super..." listing 100.1.2.0/25, 100.1.2.128/26, and 100.1.3.192/26. The instructor writes the "Rules for Super netting in CIDR" on the board, specifically noting "All network should be contiguous" and "first net id should be divisible by size of the block". He starts the solution by analyzing the first network, 100.1.2.0/25. He writes the range 100.1.2.0 - 100.1.2.127 and calculates the block size as 128, circling the number 127 to mark the end of the range.

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

    The instructor moves to the second network, 100.1.2.128/26, writing its range as 100.1.2.128 - 100.1.2.191 and noting the block size is 64. He then analyzes the third network, 100.1.3.192/26, determining its range is 100.1.3.192 - 100.1.3.255. To find the supernet, he converts the third octet of the start and end addresses into binary, writing 100.1.00000010 and 100.1.00000011. He identifies the common prefix and writes the full potential supernet range as 100.1.2.0 - 100.1.3.255 on the board to visualize the aggregation.

  3. 5:00 – 5:22 05:00-05:22

    In the final segment, the instructor synthesizes his findings to provide the final answer. He writes the supernet address in red ink as 100.1.2.0/23. This confirms that the smallest block containing all three original networks is a /23 block starting at 100.1.2.0. He circles the final answer 100.1.2.0/23 to emphasize the result, completing the process of merging the three distinct networks into a single supernet.

The lecture effectively guides students through the practical application of supernetting. By breaking down the problem into analyzing individual network ranges and then using binary logic to find the common prefix, the instructor demonstrates a clear method for CIDR aggregation. The visual aids, including the written ranges and binary conversions, reinforce the theoretical rules of contiguity and divisibility, leading to the correct identification of the supernet 100.1.2.0/23. This step-by-step approach ensures students understand not just the "how" but also the "why" behind supernetting calculations.

Loading lesson…