Class D & E

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/computer-networks/net-layer-ip-addressing/classful-addr-casting/asset-class-d-e after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
  3. Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
  4. Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
  8. Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
  9. Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
  10. Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. Paper 2 | Theory Of Computation/Automata Theory: Introduction to TOC Deterministic FA (DFA) Non-Deterministic FA Regular Expressions Grammar Regular Language Properties Moore & Mealy Machines Pushdown Automata & CFG Turing Machines Complexity Theory
  13. 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
  14. 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
  15. Paper 2 | DataBase Management System/DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF File Organization & Indexing Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery
  16. Paper 2 | Computer Networks: Introduction to CN 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
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment covers Class D and E IP addressing, following a brief review of Class A. The instructor presents slides defining each class by its binary prefix and first-octet range, emphasizing that Classes D and E are not divided into Network ID and Host ID. Class A is reviewed with NetID = 8 bits, HostID = 24 bits, first bit reserved to 0, range [0, 127], and 2^7 - 2 = 126 available networks, with reserved addresses 0.0.0.0 and 127.0.0.1 noted. Class D is defined by the first four bits reserved to 1110, range [224, 239], total addresses = 2^28 (26,84,35,456), and reserved for multicasting. Class E is defined by the first four bits reserved to 1111, range [240, 255], total addresses = 2^28 (26,84,35,456), and reserved for future or experimental purposes. A reference table lists prefixes (8, 16, 24 bits for A–C; Not applicable for D and E) and first-byte ranges. The instructor uses hand-drawn diagrams to illustrate the 32-bit address structure and bit prefixes.

Chapters

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

    The segment opens with a 'Class D' slide stating it is not divided into Network ID and Host ID, the first four bits are reserved to 1110, and the range is [224, 239]. A table on the right lists Class A through E with prefixes (n = 8, 16, 24 bits; Not applicable) and first-byte ranges from 0 to 127 up to 240 to 255. The instructor then transitions to a 'Class A' slide noting NetID = 8 bits, HostID = 24, first bit reserved to 0, and range of 1st octet [0, 127]. The instructor explains Class A network calculations, including the on-screen text 'There are 2^7 - 2 = 126 networks in Class A network,' and highlights that reserved addresses like 0.0.0.0 and 127.0.0.1 are excluded.

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

    The focus shifts to Class D and Class E characteristics. The 'Class D' slide details that the first four bits are reserved to 1110 in binary notation, the range of 1st octet is [224, 239] in dotted decimal notation, the total number of IP addresses available is 2^28 (26,84,35,456), and Class D is reserved for multicasting. The instructor uses hand-drawn diagrams to illustrate the bit structure and address ranges, gesturing toward underlined terms like '1110' and '[224, 239].' The slide then transitions to 'Class E,' stating the first four bits are reserved to 1111, the range of 1st octet is [240, 255], and Class E is reserved for future or experimental purposes. A reference table at the bottom summarizes prefixes as 'Not applicable' for both D and E, with first-byte ranges 224 to 239 and 240 to 255.

  3. 5:00 – 5:37 05:00-05:37

    The final segment shows the 'Class E' slide stating the first four bits are reserved to 1111 and the range of 1st octet is [240, 255]. The slide also reads 'Number of IP Addresses available in class E = 2^28 (26,84,35,456)' with the figure circled in ink. The instructor stands at the left edge of the whiteboard, and later frames switch back to a 'Class D' slide noting the first four bits are reserved to 1110 and the range of 1st octet is [224, 239]. A reference table at the lower right lists Class D and E prefixes as 'Not applicable' with first-byte ranges (224) to (239) and 240 to 255, reinforcing the distinction between these special-purpose classes.

The lecture systematically reviews IP address classes, moving from Class A to the special-purpose Classes D and E. The central teaching progression is: (1) Class A structure with 8-bit NetID, 24-bit HostID, first bit 0, range [0,127], and 126 usable networks after excluding reserved addresses; (2) Class D structure with 1110 prefix, range [224,239], no NetID/HostID division, 2^28 addresses, and multicast purpose; (3) Class E structure with 1111 prefix, range [240,255], no NetID/HostID division, 2^28 addresses, and experimental purpose. The key conceptual distinction is that Classes D and E lack the traditional Network/Host split, unlike A–C. The reference table serves as a summary anchor, showing prefixes and first-byte ranges for all five classes. Hand-drawn diagrams reinforce the 32-bit structure, and circled figures emphasize the total address count. The instructor's gestures toward underlined binary prefixes and ranges highlight exam-relevant identification criteria.

Loading lesson…