Class B

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/networking/net-layer-ip-addressing/classful-addr-casting/asset-class-b after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full 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…