Class C

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/computer-networks/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 2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. 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
  9. 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, Unix OS, Linux OS
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | 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
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
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…