CIDR Practice Question

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/computer-networks/net-layer-ip-addressing/cidr-vlsm/asset-cidr-practice-question-4754 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. 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, Relational Calculus, Transaction Management, Concurrency Control
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. 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, Complexity Theory
  10. 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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, 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, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a step-by-step guide to Variable Length Subnet Masking (VLSM) using a specific networking problem. The instructor starts with a single Class C network, 200.1.2.0/24, and demonstrates how to divide it into three distinct subnets with varying host requirements: one subnet needing 126 hosts and two others needing 62 hosts each. The lecture emphasizes the importance of allocating the largest subnet first to prevent address fragmentation. Through a combination of whiteboard drawing and slide presentation, the instructor derives the correct subnet masks (/25 and /26) and calculates the precise IP address ranges for each resulting subnet, concluding with a summary of CIDR formulas.

Chapters

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

    The video begins with the instructor presenting a specific problem statement on the screen: "Consider we have a big single network having IP Address 200.1.2.0/24. We want to do subnetting and divide this network into 3 subnets, such that first contains 126 hosts, and other two contains 62 hosts each?" He starts the solution by writing the network address 200.1.2.0/24 at the top of the screen. He then draws a large blue circle to represent the entire available IP address space. To the left of the circle, he writes the number "3" in a red circle, indicating the three subnets required. He proceeds to draw a vertical red line down the center of the blue circle, effectively splitting the address space into two equal halves, which is the first step in allocating the largest subnet.

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

    The instructor focuses on the first requirement: a subnet with 126 hosts. He explains that to support 126 usable hosts, the subnet must have a block size of 128 (2^7), because 2^7 - 2 = 126. This means 7 bits are needed for hosts, leaving 25 bits for the network prefix (32 - 7 = 25). He writes /25 next to the left half of the circle. Next, he addresses the remaining right half of the circle, which needs to be split into two subnets of 62 hosts each. For 62 hosts, he calculates a block size of 64 (2^6), requiring 6 host bits and a prefix length of 26 (32 - 6 = 26). He draws a horizontal line to split the right side into two quadrants and writes "62" in each. He then writes the specific subnet IDs on the right: 200.1.2.128/26 and 200.1.2.192/26, explaining the binary values 10000000 (128) and 11000000 (192) that determine these starting addresses.

  3. 5:00 – 7:43 05:00-07:43

    The instructor transitions to a slide that summarizes the final calculated subnets. The slide is divided into three sections: "1st Subnet", "2nd Subnet", and "3rd Subnet". For the 1st Subnet, it lists the IP Address as 200.1.2.0, Direct Broadcast Address as 200.1.2.127, and the Range of IP Addresses as [200.1.2.0, 200.1.2.127]. The 2nd Subnet is listed as 200.1.2.128/26 with a range of [200.1.2.128, 200.1.2.191]. The 3rd Subnet is 200.1.2.192/26 with a range of [200.1.2.192, 200.1.2.255]. Finally, a slide titled "Designing subnets for CIDR Notations" appears, showing the formula n_sub = 32 - log_2 N_sub and stating the rule that the starting address must be divisible by the number of addresses in the sub-network.

The lecture successfully bridges the gap between theoretical subnetting rules and practical application. By visually splitting the address space circle, the instructor makes the abstract concept of binary division concrete. The progression from identifying the largest host requirement to calculating the corresponding prefix length and finally listing the specific IP ranges provides a clear, repeatable method for solving VLSM problems. The inclusion of the CIDR formula slide at the end reinforces the mathematical foundation behind the visual steps, ensuring students understand both the "how" and the "why" of the subnetting process.

Loading lesson…