Class C
Duration: 6 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: UPPSC Course Overview
- Interview Preparation & Guidance: Interview Preparation
- Paper 1 | General Hindi: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, वर्णमाला, समास, संधि, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material)
- Paper 2 | General Studies: State Wise GK, Polity, Geography, History, GK- Current Affairs
- Paper 1 | Programming Language: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
- Paper 1 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, ORDBMS, NoSQL
- Paper 1 | Cyber Security: Society, Law & Ethics, 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, Ethical Hacking
- Paper 1 | Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design
- Paper 1 | 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, Network Security
- Paper 1 | Design and Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
- Paper 1 | Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
- Paper 1 | Discrete Structures and Theory of Logic: Permutation and Combination, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
- Paper 1 | Software Project Management: Software Project Management
- Paper 2 | Operating Systems: 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, Security
- 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
- Paper 2 | Artificial Intelligence & High Performance Computing: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Natural Language Processing, Emerging Tech Trends
- Paper 2 | Image Processing: Digital Image Fundamentals, Image Enhancement, Image Restoration, Color Image Processing, Image Compression
- 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
- Paper 2 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
- Paper 2 | Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, Java
- Paper 2 | Soft Computing: Fuzzy Sets, Artificial Neural Networks, Genetic Algorithms
- Paper 2 | Distributed System: Distributed Systems
- UPPSC Live Class Recordings: UPPSC Polytechnic Lecturer 2025 (CS)
- Previous Year Papers:
- 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
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: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.
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.