Basics of SubNetting

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/IBPS-SO-IT-MAINS/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. English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
  3. Quantitative Aptitude & Numerical Ability: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
  4. Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
  5. Data Structures- Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  7. Python- Professional Knowledge: Python for Placements by Yash Sir, Collections & Strings, Functions & Modules, File Handling & Data Analysis, Python Basics
  8. Operating System- Professional Knowledge: Introduction to OS, Process Management, Process Synchronization, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Windows OS
  9. DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control, Relational Algebra, Relational Calculus, NoSQL, Data Warehousing & Mining
  10. Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security, Transport Layer Services, DLL: Flow Control, Cloud Computing
  11. Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer, Instr Formats & Modes
  13. Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  14. Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
  15. Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
  16. Programming Languages- Professional Knowledge: C Programming by Yash Sir, Language Design, DMA, Macros, Scoping & File Handling, Object Oriented Programming (OOPS), Programming in C++, Java, HTML, C Language Core
  17. Emerging Tech- Professional Knowledge: Emerging Tech Trends, MS Office Applications
  18. Artificial Intelligence: Artificial Intelligence
  19. Image Processing: Digital Image Fundamentals
  20. Internet & Web Technology: Website, Browser & Services, Internet Fundamentals, Server Side & Security, 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, Cyber Safety and Security, Ethical Hacking
  21. Descriptive Paper: English Writing Ability
  22. Mains - Unit Tests:
  23. Mains - Full Mock Tests:
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…