Supernetting CIDR

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/IBPS-SO-IT-MAINS/computer-networks/net-layer-ip-addressing/supernetting-spl-ips/asset-supernetting-cidr after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
  3. Quantitative Aptitude & Numerical Ability: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
  4. Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
  5. Data Structures- Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  7. Python- Professional Knowledge: Python for Placements by Yash Sir, Collections & Strings, Functions & Modules, File Handling & Data Analysis, Python Basics
  8. Operating System- Professional Knowledge: Introduction to OS, Process Management, Process Synchronization, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Windows OS
  9. DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control, Relational Algebra, Relational Calculus, NoSQL, Data Warehousing & Mining
  10. Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security, Transport Layer Services, DLL: Flow Control, Cloud Computing
  11. Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer, Instr Formats & Modes
  13. Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  14. Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
  15. Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
  16. Programming Languages- Professional Knowledge: C Programming by Yash Sir, Language Design, DMA, Macros, Scoping & File Handling, Object Oriented Programming (OOPS), Programming in C++, Java, HTML, C Language Core
  17. Emerging Tech- Professional Knowledge: Emerging Tech Trends, MS Office Applications
  18. Artificial Intelligence: Artificial Intelligence
  19. Image Processing: Digital Image Fundamentals
  20. Internet & Web Technology: Website, Browser & Services, Internet Fundamentals, Server Side & Security, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Cyber Safety and Security, Ethical Hacking
  21. Descriptive Paper: English Writing Ability
  22. Mains - Unit Tests:
  23. Mains - Full Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture provides a detailed tutorial on supernetting within the context of Classless Inter-Domain Routing (CIDR). The instructor presents a specific problem where four /24 networks must be merged into a single supernet. He begins by listing the specific IP addresses involved and then outlines the critical rules that must be satisfied for supernetting to work correctly. The lecture progresses through a step-by-step calculation, converting decimal IP addresses to binary to identify the common prefix bits, ultimately determining the correct supernet address and subnet mask for the aggregated block.

Chapters

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

    The instructor introduces the problem statement displayed on the slide, which lists four IP networks: 200.1.0.0/24, 200.1.1.0/24, 200.1.2.0/24, and 200.1.2.0/24. He explicitly reads out the 'Rules for Super netting in CIDR' written below the list. These rules state that 'All network should be contiguous' and the 'first net id should be divisible by size of the block.' He emphasizes that these conditions are prerequisites for successful aggregation, ensuring that the networks can be logically grouped together without gaps.

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

    The instructor begins the technical analysis by writing down the third octet of the IP addresses in decimal and binary formats on the whiteboard. He writes 200.1.0.0, 200.1.1.0, 200.1.2.0, and 200.1.2.0 (noting the likely typo in the slide for the last entry, as he proceeds to treat it as a block of 4 contiguous networks). He converts the third octet values (0, 1, 2, 3 implied) into binary, writing 00000000 and 00000011. He identifies that the first six bits of the third octet are identical across the block. He calculates the new prefix length by adding the first two octets (8 + 8) to the common bits in the third octet (6), resulting in a /22 mask. He writes 200.1.00000000 and 200.1.00000011 to visualize the range. He explains that since the block size is 4, the last two bits must change, allowing for 4 distinct subnets within the supernet.

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

    The instructor finalizes the solution by writing the final supernet address 200.1.0.0/22 on the board. He draws a visual representation of the block, showing how the 4 individual /24 networks fit together under the single /22 supernet. He circles the /22 notation to highlight the final answer. He reinforces the concept that the block size of 4 requires the last two bits of the third octet to vary, while the first six remain constant, effectively summarizing the aggregation process. He emphasizes that the resulting network covers the range from 200.1.0.0 to 200.1.3.255.

The lecture effectively demonstrates the practical application of supernetting rules. By moving from the abstract rules of contiguity and divisibility to concrete binary calculations, the instructor shows how to derive a /22 mask from four /24 networks. The key takeaway is identifying the common prefix bits to determine the new subnet mask, ensuring efficient IP address allocation and routing table optimization.

Loading lesson…