SubNetting Example

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/computer-network-and-information-security/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. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, 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. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | 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, Complexity Theory
  13. Paper 2 | 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
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…