ClassLess Interdomain Routing - CIDR With Example

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/computer-networks/net-layer-ip-addressing/cidr-vlsm/asset-classless-interdomain-routing-cidr-with-example after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. Paper 2 | 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, Run Time Environment
  9. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | 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
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, 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, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment teaches how to determine the number of addresses, first address, and last address for a CIDR block using an address mask. The instructor works through the example 167.199.170.82/27, showing its binary form 10100111 11000111 10101010 01010010. The mask is formed by setting the 27 leftmost bits to 1 and the remaining 5 bits to 0. The number of addresses is calculated as N = NOT(mask) + 1, which equals 2^5 = 32. The first address is found by ANDing the given address with the mask, yielding 167.199.170.64. The last address is found by ORing the given address with NOT(mask), yielding 167.199.170.95. A summary slide titled “Address Mask” defines the mask as a 32-bit number with n leftmost bits set to 1 and the rest 0, and lists the three bitwise operations NOT, AND, and OR used to compute block properties.

Chapters

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

    The slide presents the question “Find the Number of addresses, first and last address of the CIDR block to which” with “Address: 167.199.170.82/27 (10100111 11000111 10101010 01010010) belongs to.” The instructor circles the address line and underlines binary octets, isolating the final group “01010010.” He then writes “2^5 = 32” on the whiteboard, indicating that with a /27 prefix there are 5 host bits and therefore 32 addresses in the block.

  2. 2:00 – 4:15 02:00-04:15

    A second slide states “The mask by setting 27 leftmost bits to 1 and 5 rightmost bits to 0 in dotted-decimal notation is:” and “Number of addresses in the block: N = NOT (mask) + 1 =”, with “NOT” circled in red. The instructor sketches tally marks and five circles representing the zero bits. Later slides show “First address: First = (address) AND (mask) =” and “Last address: Last = (address) OR (NOT mask) =”, with binary rows for the AND and OR operations. The computed first address 167.199.170.64 and last address 167.199.170.95 appear on screen. A final “Address Mask” slide defines the mask as a 32-bit number with n leftmost bits set to 1 and lists N = NOT(mask) + 1, first address = (any address in block) AND mask, and last address = (any address in block) OR NOT(mask).

The lesson centers on CIDR address-mask arithmetic. The key rule is that a /n prefix creates a mask with n leading 1-bits and (32-n) trailing 0-bits. From this mask, three bitwise formulas give block properties: N = NOT(mask) + 1 for the number of addresses, first address = address AND mask, and last address = address OR NOT(mask). In the worked example 167.199.170.82/27, the five trailing zero bits give 2^5 = 32 addresses. ANDing with the mask clears host bits to produce the first address 167.199.170.64, while ORing with NOT(mask) sets host bits to 1 to produce the last address 167.199.170.95. The progression moves from identifying the prefix length, to constructing the mask, to applying NOT/AND/OR operations, and finally to a summary slide that generalizes the method.

Loading lesson…