Class B

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/computer-network-and-information-security/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 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. 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, 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 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
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…