Rules of Creating CIDR Block

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-SENIOR-COMPUTER-INSTRUCTOR/paper-2-data-communication-and-network-security/net-layer-ip-addressing/cidr-vlsm/asset-rules-of-creating-cidr-block after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Paper-1 & 2 | Basic Numeracy / आधारभूत संख्यात्मक योग्यता: Ratio and Proportion / अनुपात और समानुपात, Divisibility Rules / विभाज्यता के नियम, Mixture and Alligation / मिश्रण और एलिगेशन, Permutation and Combination / क्रमचय और संचय, Logarithm / लघुगणक, Number System / संख्या पद्धति, HCF and LCM / महत्तम समापवर्तक और लघुत्तम समापवर्त्य, Sequences, Series and Combinatorics / अनुक्रम, श्रेणी और संयोजन, Time, Speed and Distance / समय, चाल और दूरी, Percentage / प्रतिशत, Average / औसत, Solid Mensuration / घन क्षेत्रमिति, Age Problems / आयु संबंधी प्रश्न, Arithmetic / अंकगणित, Statistics / सांख्यिकी, Probability / प्रायिकता, Profit, Loss and Discount / लाभ, हानि और बट्टा, Simple and Compound Interest / साधारण और चक्रवृद्धि ब्याज, Partnership / साझेदारी, Speed Mathematics and Basic Mathematics / द्रुत गणित और आधारभूत गणित, Algebra / बीजगणित, Simplification, Indices and Surds / सरलीकरण, घातांक और करणी, Time and Work / समय और कार्य, Pipe and Cistern / नल और टंकी, RSSB Specific Videos - Basic Numeracy / RSSB विशेष वीडियो - आधारभूत संख्यात्मक योग्यता, Sets, Relations, Functions and Discrete Mathematics / समुच्चय, संबंध, फलन और विविक्त गणित, Number Systems and Number Theory / संख्या पद्धति और संख्या सिद्धांत, Coordinate Geometry, Vectors and 3D Geometry / निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति, Polynomials, Equations and Complex Numbers / बहुपद, समीकरण और सम्मिश्र संख्याएँ
  3. Paper-1 & 2 | Data Interpretation / आँकड़ों की व्याख्या: Data Interpretation / आँकड़ा निर्वचन
  4. Paper-1 & 2 | General Mental Ability / सामान्य मानसिक योग्यता: Mental Ability / मानसिक योग्यता, RSSB Specific Videos - Mental Ability / RSSB विशेष वीडियो - मानसिक योग्यता
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability / तार्किक तर्कणा एवं विश्लेषणात्मक क्षमता: Series / श्रेणी, Coding-Decoding / कूट लेखन एवं कूट वाचन, Data Sufficiency / आँकड़ों की पर्याप्तता, Non-Verbal Reasoning / अशाब्दिक तर्क, Syllogisms / न्यायवाक्य, Seating Arrangement and Puzzles / बैठक व्यवस्था एवं पहेलियाँ, Blood Relations / रक्त संबंध, Direction and Distance / दिशा एवं दूरी, Analytical Reasoning (Counting Figures Reasoning) / विश्लेषणात्मक तर्क (आकृति गणना तर्क), Mathematical Operations and Missing Numbers / गणितीय संक्रियाएँ एवं लुप्त संख्या, Calendar and Clock / कैलेंडर एवं घड़ी, Clock / घड़ी, Cubes, Dice and Figure Counting / घन, पासा एवं आकृतियों की गिनती, Venn Diagrams, Syllogism and Inequalities / वेन आरेख, न्याय वाक्य एवं असमानता, Analogy and Classification / सादृश्यता एवं वर्गीकरण, Order and Ranking / क्रम एवं रैंकिंग, Statement-Based Reasoning / कथन आधारित तार्किक विवेचन, Data Arrangement / आँकड़ों की व्यवस्था, Alphabet and Number Test / वर्णमाला एवं संख्या परीक्षण, Crypt Arithmetic / कूट अंकगणित
  6. Paper-1 & 2 | Decision Making and Problem Solving / निर्णय लेना एवं समस्या समाधान: Data Sufficiency and Decision Making / आँकड़ों की पर्याप्तता एवं निर्णय क्षमता
  7. Paper-1 | General Science / सामान्य विज्ञान: Scientific Achievements and Research / वैज्ञानिक उपलब्धियाँ और अनुसंधान, Biology / जीव विज्ञान, Chemistry / रसायन विज्ञान, RSSB Specific Videos / RSSB विशेष वीडियो
  8. Paper-1 | General Awareness / सामान्य जागरूकता: State-Specific General Knowledge / राज्य विशेष सामान्य ज्ञान, Current Affairs / समसामयिकी
  9. Paper-2 | Fundamentals of Computer: Basics of COA, Number System, Floating Point Rep, Number Representation
  10. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits
  11. Paper-2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Linux OS, Distributed Systems
  12. Paper-2 | Database Management System: 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
  13. Paper-2 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  15. Paper 2 | Oops, C++, Java: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  16. 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
  17. Paper 2 | Emerging Trends and AI: Emerging Tech Trends, Computer Fundamentals, Trade, Marketing and Consumer Protection / व्यापार, विपणन एवं उपभोक्ता संरक्षण, Computer Networks, Internet of Things, Cloud Computing
  18. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Advanced Algorithms
  19. Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, 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, Ethical Hacking
  20. Paper-2 I Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  21. Paper-2 | Computer Organization and Architecture: Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations
  22. Paper-2 | Web Development: JavaScript-Basics, HTML Basics, CSS, XML
  23. Pedagogy / शिक्षाशास्त्र: Growth and Development / वृद्धि और विकास, Concept of Pedagogy / शिक्षाशास्त्र की संकल्पना, Cognitive Processes / संज्ञानात्मक प्रक्रियाएँ, Theories of Development / विकास के सिद्धांत, Inclusive Education / समावेशी शिक्षा, Experiential Pedagogy / अनुभवात्मक शिक्षाशास्त्र, Socialisation and Gender / समाजीकरण और जेंडर, National Education Policy (NEP) 2020 / राष्ट्रीय शिक्षा नीति (NEP) 2020
  24. Live Sessions: RSSB Live Sessions
  25. RSSB Paper 1 - Full Mock Tests:
  26. RSSB Paper 2 - Full Mock Tests:
  27. SCI Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment introduces the three fundamental rules for creating a valid CIDR block (network). The instructor presents a slide titled “Rules for Creating CIDR Block (Network)” listing: (1) all IP addresses in the block must be contiguous; (2) the block size, i.e., total number of IP addresses contained in the block, must be representable as a power of 2 (e.g., 2^1, 2^2, 2^3, 2^4, 2^5); and (3) the first IP address of the block must be divisible by the size of the block. The instructor then works through an example using the IP address 167.92.48.32, writing it on the board and performing related calculations involving values such as 256 and binary representations (e.g., “10000” and “11111”) to illustrate the divisibility rule. A division calculation (2300 / 106) is also shown on the right side of the board, though its exact role in the example is not fully clear from the sampled screenshots. The segment emphasizes how to verify whether a given IP address can serve as the base of a CIDR block by checking contiguity, power-of-2 size, and divisibility.

Chapters

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

    The slide “Rules for Creating CIDR Block (Network)” lists three bullets: IP addresses must be contiguous, block size must be a power of 2 (shown as “2^1, 2^2, 2^3, 2^4, 2^5”), and the first IP address must be divisible by the block size. The instructor writes “167 92 48 32” on the right, adds small figures “6” and “3” beneath the last octet, and begins a bracketed column with “17” over “17,” indicating the start of a worked example next to the rules.

  2. 2:00 – 4:26 02:00-04:26

    The instructor continues the example with 167.92.48.32, writing “256” and “257” on the board and drawing a binary representation with 16 host bits circled. A division calculation (2300 / 106) appears on the right side, and the instructor points to binary digits “10000” and “11111.” The final frame shows the three rules again with “256” and “167.92.48” on the right, reinforcing that block size must be a power of 2 and the base address must be divisible by it.

The core teaching point is that a valid CIDR block must satisfy three conditions: contiguity of addresses, power-of-2 size, and divisibility of the base address by the block size. The instructor uses 167.92.48.32 as a concrete example, writing it on the board and performing calculations involving 256 (a power of 2) and binary representations to demonstrate how the divisibility rule works. The presence of “10000” and “11111” suggests the instructor is showing how host bits or block boundaries align in binary. The division (2300 / 106) is visible but its exact purpose in the example is not fully clear from the sampled screenshots; it may relate to a different aspect of CIDR calculation or be part of an intermediate step. The segment is focused on rule application rather than deriving the rules from first principles.

Loading lesson…