Class A

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/SSC-JE-IMD-SCIENTIFIC-ASSISTANT-COMPUTER-SCIENCE/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. General Intelligence & Reasoning: Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Logical Sequence Of Words, Syllogisms, Venn Diagram, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Data Sufficiency, Puzzle Solving (Puzzles), Data Arrangement, Cubes & Dices, Calendar, Clock, Arithmetic, Number System, HCF LCM, Verbal Analogy (Word Based Analogy), Visual Recognition and Figure Completion, Paper Folding and Cutting, Transformation of Shapes, Clocks and Calendars, Direction Sense, Cubes and Dice, Patterns in Two-Dimensional Figures, Seating Arrangements, Analogy and Classification, Logical Deduction and Induction, Alphabet and Word Tests, Mathematical Operations, Series Completion, Simplification and Approximation, Coding and Decoding, Numerical Reasoning, Assembling and Grouping of Shapes, Three-Dimensional Patterns and Visualization, Vocabulary, Number System, Averages, Mixtures and Alligation, Simple and Compound Interest, Percentages, Algebra, Speed, Time and Distance, Seating and Arrangement Puzzles, Traverse Surveying, Order, Ranking and Sequence, Constraint Puzzles, Syllogisms and Venn Diagrams, Reading Comprehension, Critical Reasoning, Permutations and Combinations, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Ratio and Proportion, Time and Work, Mensuration, Data Interpretation, Powers, Surds and Logarithms, Sequences and Series, Articles and Determiners, Sentence Completion, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, Sequence and Series (Series), Speed Time and Distance, Algebra, Profit and Loss, Powers and Exponents (Surds and Indices), Permutation and Combination
  2. General Awareness: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, Environment, Static General Knowledge, GK- Current Affairs, Artificial Intelligence, MS Office Applications, Terms & Abbreviations, Keyboard Shortcuts, Evolution of Indian Banking (Banking & Financial Awareness), Emerging Tech Trends
  3. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics
  4. Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Number Systems and Codes, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Latches and Flip-Flops, Finite State Machines, Sequential Circuits and State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Latches and Flip-Flops, Number Systems and Codes, Registers and Counters
  5. Computer Organisation & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Register Transfer and Microoperations, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Registers and Counters
  6. Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, HTML Basics, OOPS with C++, Java, Object Oriented Technology
  7. Databases: 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, Database Security & Authorization
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. 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
  10. 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
  11. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Security, Windows OS, Distributed Systems, Unix OS, Linux OS
  12. Computer Networks: Introduction to CN, 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, Data Communication, Website, Browser & Services, Web Design & Development, Network Security, Cyber Threats and Malware Attacks, Cyber Safety and Security
  13. Full Length Mock Tests:
  14. Sectional Tests:
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…