Class B

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-b 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 introduces Class B IP addressing within the context of classful IPv4 networks. The instructor presents a slide titled “Class B” stating that in Class B, NetID = 16 bits and HostID = 16 bits. The first two bits are reserved as “10” in binary, which fixes the range of the first octet to [128, 191] in dotted decimal notation. The slide also gives the total number of networks available in Class B as 2^14 (16,384) and the total number of hosts that can be configured in every network as 2^16 − 2 (65,534). A comparison table at the bottom of the slide lists Class Prefixes and First byte ranges for Classes A through E, with Class B shown as 128 to 191. The instructor uses hand-drawn circles and arrows to highlight the key values 2^14 (16,384) and 2^16 − 2 (65,534), linking them to a small sketch on the right. Earlier in the segment, a transition from Class A is visible, where NetID = 8 bits and HostID = 24 bits, first bit reserved as “0”, range [0, 127], and reserved addresses such as 0.0.0.0 for broadcasting and 127.0.0.1 for loopback are mentioned.

Chapters

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

    The video opens on a “Class B” slide listing NetID = 16 bits and HostID = 16, the binary prefix “10”, first octet range [128, 191], and totals of 2^30 networks and 2^14 hosts. A transition to a “Class A” slide is visible, showing NetID = 8 bits and HostID = 24, first bit “0”, range [0, 127], and reserved addresses 0.0.0.0 (broadcast) and 127.0.0.1 (loopback). A comparison table of Class Prefixes and First byte ranges appears at the bottom.

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

    The instructor returns to the “Class B” slide, emphasizing that NetID = 16 bits and HostID = 16, with the first two bits reserved as “10” in binary. The range of the 1st octet is [128, 191]. A hand-drawn oval circles the value (16,384) next to “Total number of networks available in class B is 2^14”. The instructor points with a pen at “Total number of hosts that can be configured in every network in class B is 2^16 − 2 (65,534)”. A bottom diagram shows four “8 bits” segments with Class A–E rows labeled Prefix/Suffix, beside a “Class Prefixes / First byte” table.

  3. 5:00 – 6:09 05:00-06:09

    The “Class B” slide remains on screen with red hand-drawn circles highlighting “2^14 (16,384)” and “2^16 − 2 (65,534)”, with arrows linking them to a small sketch on the right. The bottom-left diagram shows four “8 bits” segments and rows for Class A through E with shaded Prefix and Suffix blocks. The right-hand table headed “Class | Prefixes | First byte” lists B as n = 16 bits with first byte “128 to 191”. The instructor continues pointing at the key values while explaining.

The central teaching point is the structure and capacity of Class B IPv4 addresses. The instructor defines NetID as 16 bits and HostID as 16 bits, identifies the class by the binary prefix “10”, and derives the first octet range [128, 191]. The total number of networks is given as 2^14 (16,384), and the usable hosts per network as 2^16 − 2 (65,534), with the subtraction of two accounts for network and broadcast addresses. A comparison table across Classes A–E reinforces how prefix bits determine first-byte ranges. The instructor uses hand-drawn circles, arrows, and pen gestures to draw attention to the key numerical values. The segment also briefly references Class A (NetID 8, HostID 24, range [0,127], reserved addresses) to provide context before focusing on Class B. The visual aids include a 32-bit IP structure diagram with four 8-bit segments and shaded Prefix/Suffix blocks for each class.

Loading lesson…