Supernetting CIDR

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/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. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  11. Computer Networks (Technical): 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 Security, Cloud Computing and IoT, Cyber and Info Security
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
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…