Basics of SubNetting

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-08-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 Course: About the Course
  2. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: 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, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | 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, Hardware basics
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, Physics
  19. GS Paper | 05 | Elementary Maths: Number System, Divisibility Rules, HCF LCM, Percentage, Profit and Loss, Simple Interest and Compound Interest, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Algebra, Mensuration and Geometry, Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), Mixture and Alligation, Calculus, Trigonometry, Vectors
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: GK- Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
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…