Basics of SubNetting

Duration: 11 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/subnetting-flsm-design/asset-basics-of-subnetting 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, PHP
  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, Internet of Things
  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):
  26. Full Length Mock Test – General + Computer Science:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces subnetting as a method for dividing large Class A or B networks into smaller, manageable subnets to improve security and administration. The instructor explains that maintaining very large flat networks is difficult, especially when multiple departments share the same network. A diagram illustrates how a big network can be split into several subnets. The lecture then lists advantages, such as improved security and easier maintenance, and disadvantages, including difficulty identifying a station and inability to direct broadcast from outside the network. The main worked example asks students to divide the network 200.1.2.0 into two subnets. The instructor writes the original network address and its broadcast address, draws a circle representing the address space, and divides it into two halves. Binary representations are used to show that a /24 network has 24 network bits and 8 host bits. By borrowing one bit from the host portion, two subnets are created with 128 IP addresses each. The usable host count is calculated as 128 - 2 = 126 per subnet. The final ranges are identified as 200.1.2.0 to 200.1.2.127 for the first subnet and 200.1.128.0 to 200.1.255.255 for the second subnet, with corresponding broadcast addresses.

Chapters

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

    The instructor introduces subnetting using a slide titled 'Subnetting'. The slide states that maintenance of very big networks like Class A and B is difficult for network administrators, and having all computers from different departments on the same network is less secure. The instructor gestures toward these bullet points while explaining why an organization granted a large address block may divide it into several subnets.

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

    The lecture continues with the rationale for subnetting and transitions to a conclusion slide showing a diagram of 'A Big Network' being divided into multiple subnets. The instructor then presents advantages, including improved security and easier maintenance/administration of subnets, and disadvantages, such as difficulty identifying a station and inability to direct broadcast from outside the network. A worked example is introduced: 'Consider the network having IP Address 200.1.2.0. Divide this network into two subnets.'

  3. 5:00 – 10:00 05:00-10:00

    The instructor works through the example on a whiteboard, writing 200.1.2.0 and its broadcast address 200.1.2.255, then drawing a circle to represent the address space and dividing it into two halves with a vertical line. Binary representations are written, showing 24 network bits and 8 host bits for the original /24 network. The instructor writes boundary values such as 127 and 255 in the last octet to illustrate how borrowing one host bit creates two subnets.

  4. 10:00 – 11:28 10:00-11:28

    The final segment summarizes the solution. The instructor identifies the first subnet ID as 200.1.2.0 and calculates total IP addresses as 2^7 = 128, with usable hosts equal to 128 - 2 = 126. The first subnet range is given as [200.1.2.0, 200.1.2.127] with direct broadcast address 200.1.2.127. The second subnet ID is identified as 200.1.128.0, with a direct broadcast address of 200.1.255.255, completing the division into two subnets.

The lecture follows a clear pedagogical sequence: motivation, definition, pros/cons, and worked example. It begins by explaining why subnetting is needed—large Class A/B networks are hard to maintain and less secure when departments share one flat network. The instructor then defines subnetting as dividing a granted address range into several subnets, supported by a diagram showing one big network split into multiple smaller networks. Advantages and disadvantages are explicitly listed, helping students weigh the trade-offs of subnetting. The core learning objective is demonstrated through a concrete problem: dividing 200.1.2.0 into two subnets. The instructor uses binary notation to show that the original /24 network has 8 host bits, and borrowing one bit from the host portion creates two subnets. The calculation 2^7 = 128 addresses per subnet and 126 usable hosts is emphasized. The final answer provides the two subnet IDs, their address ranges, and broadcast addresses, giving students a complete template for solving similar subnetting problems.

Loading lesson…