Fundamental Of IP Addressing

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/HEXAWARE-PREPARATION/computer-networks/net-layer-ip-addressing/classful-addr-casting/asset-fundamental-of-ip-addressing after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Speed Mathematics and Basic Mathematics, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Speed Time and Distance, Number System, HCF LCM, Data Interpretation, Age Problems, Mixture and Alligation, Partnership, Algebra, Sequence and Series (Series), Mensuration and Geometry, Arithmetic
  2. Reasoning Ability: Puzzle Solving (Puzzles), Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Syllogisms, Data Sufficiency, Ranking, Order and Sequence, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Calendar, Clock, Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning), Data Arrangement, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Vocabulary, Sentence Completion (Fill in the blanks), Active Passive Voice (Voice), Direct and Indirect Speech, Subject Verb Agreement (Verb Noun Agreement), Tenses, Preposition, Articles, Sentence Correction (Error Correction)
  4. Programming Basics (MCQs + Interview): C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
  5. OOPs (MCQs + Interview): Object Oriented Programming (OOPS)
  6. DBMS (MCQs + Interview): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Transaction Management, Decomposition Properties & 4NF, Concurrency Control, Database Recovery, File Organization & Indexing, Relational Algebra, Database Security & Authorization
  7. SQL (MCQs + Interview): SQL
  8. Operating Systems (MCQs + Interview): Introduction to OS, Process Management, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Process Synchronization, Disc Scheduling, File Management, Security
  9. Computer Networks (MCQs + Interview): 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, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
  10. Coding: Coding Questions by Yash Sir
  11. HR Interview: MR & HR Interview Preparation
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces classful IPv4 addressing, explaining that a 32-bit address is hierarchically divided into two parts: a prefix (NetworkID) of n bits that identifies the network, and a suffix (HostID) of 32 − n bits that identifies the host connection. The instructor uses a slide diagram showing the prefix/suffix split and a router-to-laptops topology, then extends the explanation with handwritten binary grids on a whiteboard. The lesson progresses to the five address classes (A, B, C, D, E), noting fixed prefix lengths and first-byte ranges such as Class A: n = 8 bits, first byte 0 to 127. It concludes by stating that classful addressing is obsolete and has been replaced by classless addressing.

Chapters

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

    The opening slide, titled 'Classful Addressing,' states that IPv4 at its inception used classes. A 32-bit address is divided into two parts: the prefix (NetworkID) and suffix (HostID). A central bar diagram labels the Prefix as 'n bits' and the Suffix as '(32 − n) bits,' with arrows to a router-and-laptops figure captioned 'Defines network' and 'Defines connection to the node.'

  2. 2:00 – 5:00 02:00-05:00

    The instructor elaborates on the prefix/suffix split, emphasizing that the prefix defines the network and the suffix defines the node. On a whiteboard to the right, handwritten binary grids represent address bits; the instructor uses a pointer to highlight specific digits, visually breaking down how n prefix bits and 32 − n suffix bits combine into a full address.

  3. 5:00 – 7:33 05:00-07:33

    The slide transitions to the five address classes A, B, C, D, and E. A table lists prefix lengths and first-byte ranges; visible text includes 'Class Prefixes First byte' and the row 'A n = 8 bits 0 to 127.' The instructor points to the table and notes that classful addressing is now obsolete, having been replaced by classless addressing.

The lecture builds from the abstract two-part model of an IPv4 address to concrete class boundaries. First, it establishes that a 32-bit address is hierarchical: the prefix identifies the network and the suffix identifies the host, with lengths n and 32 − n. The router-laptop diagram grounds this in a physical topology. Next, the whiteboard binary grids make the bit-level structure tangible by showing how individual bits map to prefix and suffix. Finally, the five-class table (A–E) introduces fixed prefix lengths and first-byte ranges, exemplified by Class A with n = 8 bits and first byte 0–127. The closing point is that this fixed-class design is obsolete and has been superseded by classless addressing. For revision, students should remember the prefix/suffix definition, the n and 32 − n relationship, the five classes, and the Class A first-byte range as a concrete anchor.

Loading lesson…