Class C

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-c 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.

The lecture covers IP address classes, focusing on Class B and Class C characteristics. It explains bit allocation for NetID and HostID, binary prefixes, first octet ranges, and calculations for total networks and hosts. The instructor uses slides with tables and hand-drawn annotations to illustrate these concepts.

Chapters

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

    The video starts with a 'Break' screen, then transitions to Class B IP addresses. The slide states NetID = 16 bits and HostID = 16, with the first two binary bits reserved as '10'. The range of the first octet is [128, 191]. Total connections are 2^30 (1,07,37,41,824), networks are 2^14 (16,384), and hosts per network are 2^16 - 2 (65,534). The instructor points to the binary prefix table and uses hand-drawn annotations for host calculations. Later, Class A is discussed: NetID = 8 bits, HostID = 24, first bit reserved as '0', range [0, 127], total connections 2^31 (2,14,74,83,648), and networks 2^7 - 2 = 126 due to reserved addresses for broadcasting (0.0.0.0) and loopback (127.0.0.1).

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

    The focus shifts to Class C IP addresses. The slide details NetID = 24 bits and HostID = 8, with the first three binary bits reserved as '110'. The range of the first octet is [192, 233]. Total connections are 2^29 (53,68,70,912), networks available are 2^21 (20,97,152), and hosts per network are 2^8 - 2 (254). The instructor circles these figures and points to the Class C row in the prefix table. A handwritten '2^56' with an arrow appears beside the hosts line in later frames, though its exact meaning is unclear from the screenshots. The bottom-left table summarizes prefixes and first byte ranges for Classes A through E, with red arrows drawn across the Class C '110' Prefix and Suffix cells.

  3. 5:00 – 5:38 05:00-05:38

    The instructor continues explaining Class C characteristics, emphasizing the 24-bit NetID and 8-bit HostID. The binary prefix '110' is highlighted, and the first octet range [192, 233] is circled. The calculation for host count, 2^8 - 2 = 254, is shown. The instructor draws a network topology diagram on the right side of the slide and points to the Class C row in the prefix table, comparing prefix lengths and first byte ranges across classes A to E.

The lecture systematically explains IP address classes, starting with Class B and moving to Class C. Key concepts include bit allocation for NetID and HostID, binary prefixes for identification, first octet ranges in dotted decimal notation, and calculations for total networks and hosts. The instructor uses slides with tables and hand-drawn annotations to illustrate these concepts, emphasizing the reserved bits for each class. Class B has a 16-bit NetID and 16-bit HostID with prefix '10', while Class C has a 24-bit NetID and 8-bit HostID with prefix '110'. The calculations for total connections, networks, and hosts per network are derived from these bit allocations. Class A is also briefly covered with an 8-bit NetID and 24-bit HostID, prefix '0', and reserved addresses for broadcasting and loopback. The lecture uses visual aids like tables and diagrams to reinforce these concepts.

Loading lesson…