Class A

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-7-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 the course: About the Course
  2. Mathematical Aptitude: संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Divisibility Rules, प्रतिशत / Percentage, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय, चाल और दूरी / Time, Speed and Distance, Age Problems, मिश्रण और एलिगेशन / Mixture and Alligation, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Pipe and Cistern, Trigonometry, Statistics, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Logical Reasoning: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, सादृश्यता एवं वर्गीकरण / Analogy and Classification, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, क्रम एवं रैंकिंग / Order and Ranking, अशाब्दिक तर्क / Non-Verbal Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, Syllogisms, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Analytical Reasoning (Counting Figures Reasoning), घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, कैलेंडर एवं घड़ी / Calendar and Clock, Clock
  4. General Knowledge: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Chemistry, Biology, History, Geography, Polity, Indian Economy, समसामयिकी / Current Affairs, Static General Knowledge, राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge
  5. Art of Teaching: शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, आकलन एवं मूल्यांकन / Assessment and Evaluation, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development, शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन / Educational Policies, Acts and Administration, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, निर्देशन एवं परामर्श / Guidance and Counselling, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, Micro-Teaching & Teaching Skills, पाठ योजना / Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | 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, Transaction Management, Concurrency Control
  14. Unit 7 | 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
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js, Git & Github
  18. Unit 11 | 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
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, कंप्यूटर नेटवर्क / Computer Networks
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
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…