SubNetting Example

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/computer-networks/net-layer-ip-addressing/subnetting-flsm-design/asset-subnetting-example after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, 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, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. 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, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture demonstrates subnetting the network 200.1.2.0 into four subnets using a quadrant circle diagram. The instructor identifies the required subnet bits, calculates block sizes and host ranges in binary/decimal, and summarizes each subnet's address range and usable hosts.

Chapters

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

    The slide states the problem: “Consider we have a big single network having IP Address 200.1.2.0. We want to do subnetting and divide this network into 4 subnets.” The instructor underlines “200.1.2.0” and “into 4 subnets,” then draws a large circle on the whiteboard, crossing it with vertical and horizontal lines to form four quadrants tagged 0–3. Above the circle, bit groups are marked “24,” “8,” and “2,” indicating the original /24 host portion is split into 2 subnet bits and 6 host bits. The first quadrant begins with “200.1.2.”

  2. 2:00 – 4:54 02:00-04:54

    The instructor fills the four quadrants with subnet calculations. Binary host patterns such as “0111 11” = 63 and “10 111 1” = 127/191 are written to find broadcast addresses. The formula “64 − 2 = 62” appears for usable hosts per subnet. Final quadrant labels “1st Subnet” through “4th Subnet” list ranges [200.1.2.0, 200.1.2.63], [200.1.2.64, 200.1.2.127], [200.1.2.128, 200.1.2.191], and [200.1.2.192, 200.1.2.255], with “Total number of IP Addresses = 2^6 = 64” and broadcast examples like “200.1.2.00111111 = 200.1.2.63.”

The lesson centers on dividing a /24 network into 4 subnets by borrowing 2 bits from the host field, leaving 6 host bits. The circle diagram maps subnet IDs to quadrants and supports binary-to-decimal conversion for block boundaries. Key results: 64 addresses per subnet, 62 usable hosts, and four contiguous ranges from .0 to .255. The method shown is a practical GATE-style subnetting workflow: identify bits, compute block size, derive broadcast addresses, and list valid host ranges.

Loading lesson…