Class B

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-08-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. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | 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
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, Physics
  19. GS Paper | 05 | Elementary Maths: Number System, Divisibility Rules, HCF LCM, Percentage, Profit and Loss, Simple Interest and Compound Interest, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Algebra, Mensuration and Geometry, Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), Mixture and Alligation, Calculus, Trigonometry, Vectors
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: GK- Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
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…