CIDR Practice Question

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-08-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. About Course: About the Course
  2. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | 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
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research
  19. GS Paper | 05 | Elementary Maths: संख्या पद्धति / Number System, Divisibility Rules, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, प्रतिशत / Percentage, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, समय और कार्य / Time and Work, समय, चाल और दूरी / Time, Speed and Distance, Algebra, घन क्षेत्रमिति / Solid Mensuration, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), मिश्रण और एलिगेशन / Mixture and Alligation, Calculus, Trigonometry, Vectors, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, यूक्लिडीय ज्यामिति और क्षेत्रमिति / Euclidean Geometry and Mensuration, सांख्यिकी और प्रायिकता / Statistics and Probability, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers, समतल क्षेत्रमिति / Plane Mensuration, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: समसामयिकी / Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
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…