CIDR supernetting

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/computer-networks/net-layer-ip-addressing/supernetting-spl-ips/asset-cidr-supernetting after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. 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
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. 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
  9. 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, Unix OS, Linux OS
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | Computer Networks: 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
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, 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, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
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…