Class D & E

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-POLYTECHNIC-LECTURER-COMPUTER-SCIENCE/paper-1-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. Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  2. Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Pipelining, Multiprocessors
  4. Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  5. Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  6. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  7. Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
  8. 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  9. Operating Systems: 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, Security
  10. Database Management Systems: 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, ORDBMS, NoSQL
  11. 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, Network Security
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…