CIDR Practice Question

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/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. Communication Round: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Direct and Indirect Speech, Active Passive Voice (Voice), Verbal Analogy (Word Based Analogy), Articles, Preposition, Conjunction, Sentence Construction, English Writing Ability, Communication Assessment
  2. Quantitative Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Speed Time and Distance, Percentage, Average, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Age Problems, Pipe and Cistern, Probability, Profit and Loss, Simple Interest and Compound Interest, Algebra
  3. Analytical and Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Puzzle Solving (Puzzles), Syllogisms, Seating Arrangements, Calendar, Clock, Blood Relations, Cubes & Dices, Venn Diagram, Analytical Reasoning (Counting Figures Reasoning)
  4. Cognizant Gaming Aptitude: Gamified / Game Based Aptitude
  5. Java (Cluster 1): Java
  6. ANSI SQL MySQL (Cluster 1,2,3): SQL
  7. HTML, CSS, JavaScript (Cluster 1,3): HTML, CSS, JavaScript
  8. Python (Cluster 2): Python for Placements by Yash Sir
  9. Cloud Fundamentals (Cluster 2): Emerging Tech Trends
  10. C# (Cluster 3): C#
  11. OOPs: Object Oriented Programming (OOPS)
  12. Technical Assessment (Coding): Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Pseudo Codes
  13. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  15. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  16. 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, Network Security, Cloud Computing and IoT, Cyber and Info Security
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…