SubNetting Example

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-POLYTECHNIC-LECTURER-COMPUTER-SCIENCE/paper-1-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. Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  2. Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Pipelining, Multiprocessors
  4. Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  5. Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  6. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  7. Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
  8. Compiler Design: 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  9. Operating Systems: 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, Security
  10. Database Management Systems: 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, ORDBMS, NoSQL
  11. 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, Network Security
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…