Rules of Creating CIDR Block
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- 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
- 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
- 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
- Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- 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
- Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- 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
- 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
- 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
- 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
- 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
- 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
- Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends, Internet of Things
- Paper 2 | Cloud Technology: Cloud Computing
- Paper 2 | Probability and statistics: Probability, Statistics
- 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
- 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
- Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
- Full Length Mock Test:
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
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: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.