Class D & E

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/computer-networks-security/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-2 | Programming & 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
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. 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, 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, Waveform Generators and Timer 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
  7. 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
  8. Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India 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…