Super Netting in ClassFul Addressing

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-7-computer-networks/net-layer-ip-addressing/supernetting-spl-ips/asset-super-netting-in-classful-addressing after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the course: About the Course
  2. Mathematical Aptitude: संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Divisibility Rules, प्रतिशत / Percentage, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय, चाल और दूरी / Time, Speed and Distance, Age Problems, मिश्रण और एलिगेशन / Mixture and Alligation, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Pipe and Cistern, Trigonometry, Statistics, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Logical Reasoning: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, सादृश्यता एवं वर्गीकरण / Analogy and Classification, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, क्रम एवं रैंकिंग / Order and Ranking, अशाब्दिक तर्क / Non-Verbal Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, Syllogisms, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Analytical Reasoning (Counting Figures Reasoning), घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, कैलेंडर एवं घड़ी / Calendar and Clock, Clock
  4. General Knowledge: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Chemistry, Biology, History, Geography, Polity, Indian Economy, समसामयिकी / Current Affairs, Static General Knowledge
  5. Art of Teaching: शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, आकलन एवं मूल्यांकन / Assessment and Evaluation, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development, शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन / Educational Policies, Acts and Administration, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, निर्देशन एवं परामर्श / Guidance and Counselling, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, Micro-Teaching & Teaching Skills, पाठ योजना / Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: 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
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | Database Management System: 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
  14. Unit 7 | 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
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js
  18. Unit 11 | Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, कंप्यूटर नेटवर्क / Computer Networks
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture introduces super netting in classful addressing as a method to combine multiple Class C blocks into a larger supernet, addressing the limitation that a single Class C block (256 addresses) is often insufficient for organizations. The instructor explains that super netting decreases the number of 1s in the subnet mask and contrasts it with subnetting, which increases routing table size. A hand-drawn diagram of four small circles enclosed by a larger circle illustrates the concept of combining blocks. The lecture then transitions to CIDR aggregation, presenting three rules: networks must be contiguous, all network sizes should be the same, and the first net ID should be divisible by the size of the block. A worked example performs CIDR aggregation on four /24 addresses (128.56.24.0/24 through 128.56.27.0/24). The instructor writes binary expansions of these addresses, identifies differing bits by drawing a vertical line and circling them, and begins deriving the aggregated prefix. The final visible result on the board is 128.56.24.0/32, though this appears to be an intermediate or partially visible step in the aggregation process.

Chapters

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

    The slide titled 'Super netting in Classful addressing' introduces the concept, noting that a Class C block with 256 addresses did not satisfy most organizations' needs. The instructor explains that an organization can apply for a set of Class C blocks instead of just one, forming a 'super network or a supernet.' A hand-drawn diagram appears showing four small circles enclosed by a larger circle, visually representing the combination of blocks. The slide also states that 'Super netting decreases the number of 1s in the mask,' which is underlined for emphasis.

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

    The instructor elaborates on the slide content, with red pen underlines added to key phrases such as 'increase size of routing table' and 'super netting.' The slide contrasts subnetting, which increases routing table size, with super netting as a counter idea. The instructor then transitions to a new slide titled 'Super netting / Aggregation with CIDR,' presenting three rules: all networks should be contiguous, the size of all networks should be the same, and the first net ID should be divisible by the size of the block. The instructor introduces a practical example asking to perform CIDR aggregation on four /24 IP addresses, beginning with '128.56.24.0/24' and '128.56.25.0/24.'

  3. 5:00 – 6:27 05:00-06:27

    The instructor writes binary expansions of the four listed /24 addresses (128.56.24.0/24, 128.56.25.0/24, 128.56.26.0/24, and 128.56.27.0/24) on the whiteboard. He draws a vertical line through the differing bits of each binary row and circles those bits, with an arrow pointing to the right, indicating where the prefix changes. At the bottom of the board, he writes '128.56.24.0/32' with a small red mark beside it, which appears to be part of the aggregation derivation process. The instructor gestures toward the binary rows with an open hand, emphasizing the bit-level analysis required for CIDR aggregation.

The lecture progresses from conceptual introduction to practical application. It begins by establishing the motivation for super netting: Class C blocks are too small for many organizations, so multiple blocks can be combined into a supernet. The key mechanism is reducing the number of 1s in the subnet mask, which expands the address range. The visual diagram of nested circles reinforces this idea. The lecture then formalizes the process through CIDR aggregation rules, ensuring that networks are contiguous, uniform in size, and properly aligned. The worked example demonstrates the bit-level analysis: by comparing binary representations of consecutive /24 addresses, the instructor identifies the common prefix and determines the aggregated network. The final visible result of 128.56.24.0/32 suggests the instructor is working through the prefix length determination, though the exact final aggregated prefix may not be fully visible in the sampled screenshots. The teaching flow moves from 'why' (organizational needs) to 'how' (CIDR rules and binary analysis), providing a structured approach to network aggregation.

Loading lesson…