CIDR Practice Question_

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COCUBES-PREPARATION/computer-networks/net-layer-ip-addressing/cidr-vlsm/asset-cidr-practice-question-4748 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude: Number System, Divisibility Rules, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Mixture and Alligation, Partnership, Age Problems, Time and Work, Pipe and Cistern, Speed Time and Distance, Algebra, Arithmetic, Data Interpretation, Sequence and Series (Series), Logarithm, Powers and Exponents (Surds and Indices), Permutation and Combination, Probability, Speed Mathematics and Basic Mathematics, Trigonometry
  2. Logical Reasoning: Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Syllogisms, Inequality, Data Sufficiency, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Venn Diagram, Logical Sequence Of Words, Calendar, Clock, Cubes & Dices, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Noun, Pronoun, Adjectives, Verb, Adverb, Tenses, Subject Verb Agreement (Verb Noun Agreement), Articles, Preposition, Conjunction, Modals, Determiner, Vocabulary, 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), Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Construction
  4. Data Structures (Domain Test): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  5. Algorithms (Domain Test):
  6. OOPs (Domain Test): Object Oriented Programming (OOPS)
  7. DBMS (Domain Test): 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
  8. SQL (Domain Test): SQL
  9. Operating Systems (Domain Test): 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
  10. Computer Networks (Domain Test): 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
  11. Coding: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
  12. Written English Test: English Writing Ability
  13. Psychometric Test: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture focuses on validating and representing a specific range of IP addresses as a Classless Inter-Domain Routing (CIDR) block. The instructor presents a problem involving the range 150.10.20.64 to 150.10.20.127 and systematically applies three specific rules to determine validity. He calculates the total number of addresses, verifies it is a power of two, and checks the divisibility of the starting address. Finally, he derives the subnet mask length by calculating the necessary host bits to complete the CIDR notation.

Chapters

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

    The instructor introduces the problem statement on screen: 'Consider a block of IP Addresses ranging from 150.10.20.64 to 150.10.20.127'. He lists three rules for CIDR blocks: contiguity, power-of-two size, and divisibility of the first address. He calculates the block size using the formula 127 - 64 + 1, resulting in 64. He lists powers of 2 (2, 4, 8, 16, 32, 64) to confirm 64 is valid. He then checks the third rule by dividing the first address (64) by the block size (64), noting the remainder is zero. He concludes the block is valid. He emphasizes that the first address must be divisible by the size to ensure the host ID ranges from all 0s to all 1s.

  2. 2:00 – 3:00 02:00-03:00

    The instructor proceeds to find the CIDR representation. He draws a 32-bit IP structure divided into Network ID and Host ID. Since the block size is 64, he determines that 6 bits are required for the host portion because 2^6 = 64. He subtracts these 6 host bits from the total 32 bits to find the network prefix length: 32 - 6 = 26. He writes the final CIDR notation as 150.10.20.64/26. He briefly sketches the binary values for the last octet to illustrate the range from 01000000 to 01111111. He explains that the network ID remains constant while the host ID varies across the block.

The lesson demonstrates a step-by-step algorithm for CIDR validation. First, calculate the total count of addresses. Second, verify the count is a power of 2. Third, ensure the starting address is a multiple of that count. Once validated, the host bits are derived from the log base 2 of the block size, and the prefix length is the remainder of 32 minus the host bits. This process ensures the IP block is aligned correctly within the address space.

Loading lesson…