Class A

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/computer-networks/net-layer-ip-addressing/classful-addr-casting/asset-class-a after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, 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. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. 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, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: 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, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces Class A IP addressing, focusing on its structure, address ranges, and capacity calculations. The instructor presents a slide titled "Class A" with bullet points explaining that Class A addresses have an 8-bit NetID and a 24-bit HostID. The first bit is reserved as 0 in binary notation, which limits the range of the first octet to [0, 127] in dotted decimal notation. The total number of possible connections is calculated as 2^31 (2,14,74,83,648), while the number of available networks is 2^7 - 2 = 126, accounting for reserved addresses. The instructor highlights that IP address 0.0.0.0 is reserved for broadcasting and 127.0.0.1 is reserved for loopback testing. A table shows class prefixes, with Class A having a 0 prefix and first byte range of 0 to 127. The lecture then transitions to host capacity, explaining that there are 2^24 - 2 (1,67,77,214) HostIDs in Class A, with the reduction of 2 due to reserved all-zero and all-one host addresses. The instructor notes that Class A is used by organizations requiring very large networks, such as Indian Railways. Throughout the lecture, the instructor uses gestures and a pen to point at key values on the slide, including circled numbers and handwritten annotations like 2^7 = 128.

Chapters

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

    The lecture opens with a slide titled "Class A" displaying bullet points and two tables. The instructor, wearing a black shirt with red collar and glasses, stands at the right edge before moving to gesture toward the content. Visible bullets state "In Class A NetID = 8 bits and HostID = 24," "First bit is reserved to 0 in binary notation," and "Range of 1st octet is [0, 127] in dotted decimal notation." A right-hand table shows column headers "Class Prefixes" and "First byte," while a lower table lists Class A–E prefixes (0, 10, 110, "1110 Multicast addresses," "1111 Reserved for future use") beneath a four-segment "8 bits" diagram. The instructor points to the binary representation and the '0 Prefix' for Class A, explaining that the first bit being 0 limits the first octet range.

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

    The instructor continues explaining Class A characteristics, gesturing with both hands and then pointing with a pen at the right-hand diagram. The slide displays "Total number of connections in class A is 2^31 (2,14,74,83,648)," with the value circled. Below this, "There are 2^7 -2 = 126 networks in Class A network" appears, with sub-bullets noting "IP Address 0.0.0.0 is reserved for broadcasting requirements" and "IP Address 127.0.0.1 is reserved for loopback address used for software testing." Handwritten notes show "2^7 = 128" beside a sketched binary bit diagram with bits circled as "0 1-7" and "24." The instructor explains why available networks are 2 less than the theoretical maximum of 128, due to reserved addresses.

  3. 5:00 – 8:48 05:00-08:48

    The slide transitions to host-count information, displaying "There are 2^24 - 2 (1,67,77,214) HostID in Class A." The instructor explains that hosts are 2 less than 2^24 because of reserved all-zero and all-one host addresses. The slide also states "Class A is used by organizations requiring very large size networks like Indian Railways." The opening slide remains visible with the circled value "2,14,74,83,648" and handwritten notes showing "2^7=128." A hand holding a marker is visible at the lower right as the instructor emphasizes key calculations. The table continues to show "0 Prefix" and "0 to 127" for Class A, reinforcing the first octet range.

The lecture systematically covers Class A IP addressing from structure to capacity. It begins by establishing the fundamental split: 8 bits for NetID and 24 bits for HostID. The instructor emphasizes that the first bit is fixed as 0, which constrains the first octet to values 0 through 127. This binary constraint leads to the calculation of available networks: 2^7 = 128 possible values, minus 2 reserved addresses (0.0.0.0 for broadcast and 127.0.0.1 for loopback), yielding 126 usable networks. The total connection capacity is presented as 2^31, equal to 2,14,74,83,648. The lecture then shifts to host capacity within a single Class A network: 2^24 - 2 = 1,67,77,214 usable hosts, with the subtraction of 2 accounting for all-zero (network address) and all-one (broadcast address) host portions. The practical application is highlighted by noting that Class A addresses serve organizations needing very large networks, with Indian Railways given as an example. The instructor uses visual aids including circled values, handwritten annotations, and a class prefix table to reinforce these calculations.

Loading lesson…