Class A

Duration: 9 min

This video lesson is available to enrolled students.

Inside: a video lesson and guided study material.

Module outline

Quantitative Aptitude: Number System, Divisibility Rules, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Mixture and Alligation, Partnership, Age Problems, Time and Work, Pipe and Cistern, Speed Time and Distance, Algebra, Arithmetic, Data Interpretation, Sequence and Series (Series), Logarithm, Powers and Exponents (Surds and Indices), Permutation and Combination, Probability, Speed Mathematics and Basic Mathematics, Trigonometry
Logical Reasoning: Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Syllogisms, Inequality, Data Sufficiency, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Venn Diagram, Logical Sequence Of Words, Calendar, Clock, Cubes & Dices, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
Verbal Ability: Noun, Pronoun, Adjectives, Verb, Adverb, Tenses, Subject Verb Agreement (Verb Noun Agreement), Articles, Preposition, Conjunction, Modals, Determiner, Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Construction
Data Structures (Domain Test): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
Algorithms (Domain Test):
OOPs (Domain Test): Object Oriented Programming (OOPS)
DBMS (Domain Test): 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
SQL (Domain Test): SQL
Operating Systems (Domain Test): 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
Computer Networks (Domain Test): 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
Coding: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
Written English Test: English Writing Ability
Psychometric Test: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric 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

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: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.
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.