SubNetting Example

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/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. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  11. Computer Networks (Technical): 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, Cloud Computing and IoT, Cyber and Info Security
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
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…