CIDR Practice Question_

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/CDAC-C-CAT-COMPLETE-PREPARATION/section-b-networking/net-layer-ip-addressing/cidr-vlsm/asset-cidr-practice-question-4748 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Section A | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Preposition, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Articles, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Verbal Analogy (Word Based Analogy)
  2. Section A | Quant Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Arithmetic, Algebra, Powers and Exponents (Surds and Indices), Average, Age Problems, Percentage, Profit and Loss, Partnership, Time and Work, Simple Interest and Compound Interest, Mensuration and Geometry, Probability, Pipe and Cistern
  3. Section A | Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Calendar, Clock, Blood Relations, Directions (Direction Test), Seating Arrangements, Ranking, Order and Sequence, Puzzle Solving (Puzzles)
  4. Section B | C Programming: C Programming by Yash Sir, Coding Questions by Yash Sir
  5. Section B | Data Structures: Algorithm Analysis, Greedy Algorithms, Time Complexity Analysis, Sorting Algorithms, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs
  6. Section B | OOP (C++): Object Oriented Programming (OOPS), Programming in C++
  7. Section B | OS: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS
  8. Section B | Networking: 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
  9. Section B | AI & Big Data Basics: AI & ML by Arun Sir, Big Data Systems
  10. Section C | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  11. Section A, C | Comp. Fundamentals, COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  12. MOCK 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…