Class C

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/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. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  11. Computer Networks (Technical): 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, Cloud Computing and IoT, Cyber and Info Security
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
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…