CIDR supernetting
Duration: 5 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About the Course: About the Course
- Paper-1 & 2 | Basic Numeracy: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Mensuration and Geometry, Age Problems, Arithmetic, Statistics, Probability, Profit and Loss, Simple Interest and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, Powers and Exponents (Surds and Indices), Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy
- Paper-1 & 2 | Data Interpretation: Data Interpretation
- Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
- Paper-1 & 2 | Logical Reasoning and Analytical Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Analogy, Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement, Logical Sequence Of Words, Crypt Arithmetic
- Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
- Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
- Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
- Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits
- Paper-2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Calculus, Relational Algebra, SQL, NoSQL
- Paper-2 | Data Structures & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Algorithm Analysis, Sorting Algorithms, Intro to Compilers, Hashing
- Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, Data Link Layer - Ethernet, DLL: Error Control, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Application Layer, Hardware basics, Network Security, Ethical Hacking
- Paper-2 | Operating Systems: Introduction to OS, Process Management, Memory Management, File Management, Deadlock
- Paper-2 | Computer Organization and Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer, Number System, Number Representation
- Paper 2 | System Analysis and Design: Fundamentals of Systems and Information Systems, Fundamentals of Software Engineering, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance, Software Testing
- Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Paper 2 | OOPS , C++ , JAVA: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
- Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
- Emerging Trends and AI: Emerging Tech Trends, Artificial Intelligence
- Paper-2 | Data Processing (Ms-Office): MS Office Applications
- Paper-2 | Internet and Web Technologies: HTML Basics, CSS, XML, JavaScript-Basics, Internet Fundamentals, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, Terms & Abbreviations, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing
- Paper 2 | Pedagogy: Child Development, Theories, Concept of Pedagogy, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Psychology, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
- Live Classes: RSSB Live Sessions
- Paper 1 - Full Mock Tests:
- Paper 2 - Full Mock Tests:
- BCI Previous Year Papers:
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
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: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.
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.